Login / Signup
Derandomizing Arthur-Merlin Games and Approximate Counting Implies Exponential-Size Lower Bounds.
Dan Gutfreund
Akinori Kawachi
Published in:
Electron. Colloquium Comput. Complex. (2009)
Keyphrases
</>
exponential size
lower bound
upper bound
branch and bound
objective function
branch and bound algorithm
polynomial size
worst case
np hard
lower and upper bounds
optimal solution
game playing
upper and lower bounds
learning algorithm