Login / Signup
New connections between derandomization, worst-case complexity and average-case complexity.
Dan Gutfreund
Amnon Ta-Shma
Published in:
Electron. Colloquium Comput. Complex. (2006)
Keyphrases
</>
average case complexity
average case
worst case
lower bound
upper bound
uniform distribution
np hard
greedy algorithm
space complexity
branch and bound
sample size
vc dimension
computational complexity
decision trees
structured data
complexity bounds
optimal solution