A Polynomial-Time Algorithm for Reachability in Branching VASS in Dimension One.
Stefan GöllerChristoph HaaseRanko LazicPatrick TotzkePublished in: CoRR (2016)
Keyphrases
- learning algorithm
- preprocessing
- experimental evaluation
- computational complexity
- times faster
- classification algorithm
- cost function
- k means
- dynamic programming
- theoretical analysis
- detection algorithm
- matching algorithm
- significant improvement
- high accuracy
- worst case
- improved algorithm
- search space
- randomized algorithm
- strongly polynomial
- tree structure
- linear programming
- simulated annealing
- np hard
- objective function