Lower Bounds for the Reachability Problem in Fixed Dimensional VASSes.
Wojciech CzerwinskiLukasz OrlikowskiPublished in: LICS (2022)
Keyphrases
- lower bound
- upper bound
- objective function
- np hard
- multi dimensional
- branch and bound algorithm
- lower and upper bounds
- state space
- worst case
- branch and bound
- upper and lower bounds
- optimal solution
- transitive closure
- quadratic assignment problem
- lower bounding
- query processing
- high dimensional
- learning algorithm
- knapsack problem
- vc dimension
- lagrangian relaxation