Sciweavers

STACS
2010
Springer
14 years 7 months ago
Collapsing and Separating Completeness Notions under Average-Case and Worst-Case Hypotheses
This paper presents the following results on sets that are complete for NP. (i) If there is a problem in NP that requires 2nΩ(1) time at almost all lengths, then every many-one N...
Xiaoyang Gu, John M. Hitchcock, Aduri Pavan