Sign in
Derandomizing Arthur-Merlin Games and Approximate Counting Implies Exponential-Size Lower Bounds.
Baris Aydinlioglu
Dan Gutfreund
John M. Hitchcock
Akinori Kawachi
Published in:
Comput. Complex. (2011)
Keyphrases
</>
exponential size
lower bound
upper bound
polynomial size
branch and bound
objective function
optimal solution
branch and bound algorithm
special case
np hard
lower and upper bounds
orders of magnitude
random instances
game playing
search algorithm
worst case