Average Case Completeness

@article{Gurevich1991AverageCC,
  title={Average Case Completeness},
  author={Yuri Gurevich},
  journal={J. Comput. Syst. Sci.},
  year={1991},
  volume={42},
  pages={346-398}
}
We explain and advance Levin’s theory of average case completeness. In particular, we exhibit examples of problems complete in the average case and prove a limitation on the power of deterministic reductions. ∗J. Computer and System Sciences 42:3, June 1991, 346–398. †Partially supported by NSF grant DCR 85-03275. 
Highly Influential
This paper has highly influenced 14 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS

From This Paper

Topics from this paper.

Citations

Publications citing this paper.
Showing 1-10 of 79 extracted citations

Fine Separation of Average-Time Complexity Classes

SIAM J. Comput. • 1999
View 7 Excerpts
Highly Influenced

Average-Case Non-Approximability of Optimisation Problems

Theory of Computing Systems • 2007
View 5 Excerpts
Highly Influenced

Finding hard instances of the satisfiability problem: A survey

Satisfiability Problem: Theory and Applications • 1996
View 5 Excerpts
Highly Influenced

Smoothed Complexity Theory

View 5 Excerpts
Highly Influenced

Smoothed Complexity Theory

View 4 Excerpts
Highly Influenced

References

Publications referenced by this paper.

Similar Papers

Loading similar papers…