Sign in
Derandomizing Arthur-Merlin Games and Approximate Counting Implies Exponential-Size Lower Bounds.
Dan Gutfreund
Akinori Kawachi
Published in:
Computational Complexity Conference (2010)
Keyphrases
</>
exponential size
lower bound
upper bound
branch and bound
polynomial size
objective function
branch and bound algorithm
optimal solution
upper and lower bounds
worst case
game playing
np hard
machine learning
relational databases
sample size
vc dimension