Upper-Bounding Proof Length with the Busy Beaver.

Gustavo Lacerda

Published in: CoRR (2014)

Keyphrases

upper bounding
upper bound
branch and bound algorithm
lower bound
lower bounding
linear programming relaxation
dynamic time warping
similarity measure
optimal solution
query processing
np hard
scheduling problem
similarity search
branch and bound
multi step