Login / Signup
Uniform Derandomization from Pathetic Lower Bounds.
Eric Allender
Vikraman Arvind
Fengming Wang
Published in:
Electron. Colloquium Comput. Complex. (2010)
Keyphrases
</>
lower bound
upper bound
branch and bound algorithm
lower bounding
objective function
branch and bound
optimal solution
np hard
vc dimension
lower and upper bounds
upper and lower bounds
dynamic programming
quadratic assignment problem
randomly generated problems
neural network
worst case