Login / Signup
Improved Ackermannian lower bound for the VASS reachability problem.
Slawomir Lasota
Published in:
CoRR (2021)
Keyphrases
</>
lower bound
upper bound
objective function
sufficiently accurate
lower and upper bounds
branch and bound algorithm
np hard
branch and bound
state space
lagrangian relaxation
optimal solution
e learning
information retrieval
simulated annealing
data sets
lower bounding
data mining