Relativized Worlds without Worst-Case to Average-Case Reductions for NP.

Published in: ACM Trans. Comput. Theory (2012)

Keyphrases

average case
worst case
np hard
computational complexity
worst case analysis
learning curves
upper bound
greedy algorithm
lower bound
uniform distribution
approximation algorithms
online algorithms
vc dimension
special case
sample complexity bounds
average case complexity
np hardness