Structural average case complexity
From MaRDI portal
Recommendations
Cited in
(20)- Average case complexity under the universal distribution equals worst- case complexity
- Reductions do not preserve fast convergence rates in average time
- Polynomial time samplable distributions
- Encoding invariance in average case complexity
- Average-case bit-complexity theory of real functions
- Notes on Levin's theory of average-case complexity
- Randomizing Reductions of Search Problems
- Structural Complexity of AvgBPP
- scientific article; zbMATH DE number 5081744 (Why is no real title available?)
- Average-Case Complexity
- scientific article; zbMATH DE number 1332675 (Why is no real title available?)
- scientific article; zbMATH DE number 512799 (Why is no real title available?)
- scientific article; zbMATH DE number 512870 (Why is no real title available?)
- Worst-Case to Average-Case Reductions for Subclasses of P
- Using depth to capture average-case complexity.
- Average-case intractability vs. worst-case intractability
- Sets computable in polynomial time on average
- Reductions and convergence rates of average time
- Structural complexity of AvgBPP
- Structure in average case complexity
This page was built for publication: Structural average case complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1916530)