The following pages link to On average time hierarchies (Q1313704):
Displaying 7 items.
- On proving time constructibility of functions (Q1059393) (← links)
- An average complexity measure that yields tight hierarchies (Q1355380) (← links)
- No NP problems averaging over ranking of distributions are harder (Q1391309) (← links)
- Worst-Case to Average-Case Reductions for Subclasses of P (Q5098780) (← links)
- Fundamentals of Computation Theory (Q5900808) (← links)
- Rankable distributions do not provide harder instances than uniform distributions (Q6085735) (← links)
- Structure in average case complexity (Q6487946) (← links)