Worst-Case Vs. Algorithmic Average-Case Complexity in the Polynomial-Time Hierarchy.
Dan GutfreundPublished in: APPROX-RANDOM (2006)
Keyphrases
- worst case
- average case
- average case complexity
- lower bound
- upper bound
- approximation algorithms
- np hard
- greedy algorithm
- complexity theoretic
- space complexity
- hierarchical structure
- error bounds
- computational complexity
- sample size
- vc dimension
- theoretical analysis
- np hardness
- special case
- machine learning
- orders of magnitude