Skip to main content
SpringerLink
Log in

Average case complexity

  • Formal Languages And Complexity (Session 15)
  • Conference paper
  • First Online:
Automata, Languages and Programming (ICALP 1991)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 510))

Included in the following conference series:

Abstract

We attempt to motivate, justify and survey the average case reduction theory.

Partially supported by NSF grant CCR 89-04728.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Shai Ben-David, Benny Chor, Oded Goldreich and Michael Luby, “On the Theory of Average Case Complexity”, Symposium on Theory of Computing, ACM, 1989, 204–216.

    Google Scholar 

  2. Andreas Blass and Yuri Gurevich, “On the Reduction Theory for Average-Case Complexity”, in Proc. of CSL'90, 4th Workshop on Computer Science Logic (Eds. E. Börger, H. Kleine Büning and M. Richter), Springer LNCS, 1991.

    Google Scholar 

  3. Michael R. Garey and David S. Johnson, “Computers and Intractability: A Guide to the Theory of NP-Completeness”, Freeman, New York, 1979.

    Google Scholar 

  4. Oded Goldreich, “Towards a Theory of Average Case Complexity: A survey”, TR-531, Computer Science Dept., Technion, Haifa, Israel, March 1988.

    Google Scholar 

  5. Per Grape, “Complete Problems with L-Samplable Distributions”, 2nd Scandinavian Workshop on Algorithm Theory, Springer Lecture Notes in Computer Science 447, 1990, 360–367.

    Google Scholar 

  6. Yuri Gurevich, “Average Case Complexity”, J. Computer and System Sciences (a special issue on FOCS'87), to appear.

    Google Scholar 

  7. Y. Gurevich, “The Challenger-Solver game: Variations on the Theme of P=?NP”, Bulletin of European Assoc. for Theor. Computer Science, October 1989, 112–121.

    Google Scholar 

  8. Yuri Gurevich, “Matrix Decomposition Problem is Complete for the Average Case”, Symposium on Foundations of Computer Science, IEEE Computer Society Press, 1990, 802–811. A full version of this paper, coauthored by Blass and Gurevich, is being prepared for publication.

    Google Scholar 

  9. Yuri Gurevich and Saharon Shelah, “Expected computation time for Hamiltonian Path Problem”, SIAM J. on Computing 16:3 (1987), 486–502.

    Google Scholar 

  10. Johan Hastad, “Pseudo-Random Generators under Uniform Functions”, Symposium on Theory of Computing, ACM, 1990, 395–404.

    Google Scholar 

  11. Russel Impagliazzo and Stephen Rudich, private communication.

    Google Scholar 

  12. Russel Impagliazzo and Leonid A. Levin, “No Better Ways to Generate Hard NP Instances than Picking Uniformly at Random”, Symposium on Foundations of Computer Science, IEEE Computer Society Press, 1990, 812–821.

    Google Scholar 

  13. Russel Impagliazzo, Leonid A. Levin and Michael Luby, “Pseudo-Random Generation from One-Way Functions”, 21st Symposium on Theory of Computing, ACM, New York, 1989, 12–24.

    Google Scholar 

  14. David S. Johnson, “The NP-Completeness Column”, Journal of Algorithms 5 (1984), 284–299.

    Google Scholar 

  15. P.M.W. Knijnenburg, “On Randomizing Decision Problems: A Survey of the Theory of Randomized NP”, Tech. Report RUU-CS-88-15, Rijksuniversitait Utrecht, The Netherlands, March 1988.

    Google Scholar 

  16. Leonid A. Levin, “Average Case Complete Problems”, STOC 1984, the final version in SIAM Journal of Computing, 1986.

    Google Scholar 

  17. Leonid A. Levin, “One-Way Functions and Pseudo-Random Generators”, Symposium on Theory of Computing, ACM, 1985, 363–375.

    Google Scholar 

  18. Ming Li and Paul M. B. Vitani, “Average Case Complexity under the Universal Distribution Equals Worst Case Complexity”, Manuscript, 1989.

    Google Scholar 

  19. Robert E. Schapire, “The Emerging Theory of Average Case Complexity”, Tech. Report MIT/LCS/TM-431, June 1990.

    Google Scholar 

  20. Boris A. Trakhtenbrot, “A Survey of Russian Approaches to Perebor (Brute-Force Search) Algorithms”, Annals of the History of Computing, 6:4 (1984), 384–400.

    Google Scholar 

  21. Ramarathnam Venkatesan and Leonid Levin, “Random Instances of a Graph Coloring Problem are Hard”, Symposium on Theory of Computing, ACM, 1988, 217–222.

    Google Scholar 

  22. Ramarathnam Venkatesan, private correspondence.

    Google Scholar 

  23. Herbert S. Wilf, Some Examples of Combinatorial Averaging, American Math. Monthly 92 (1985), 250–261.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. EECS Dept., University of Michigan, 1301 Beal Ave., 48109-2122, Ann Arbor, MI

    Yuri Gurevich

Authors
  1. Yuri Gurevich
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Javier Leach Albert Burkhard Monien Mario Rodríguez Artalejo

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Gurevich, Y. (1991). Average case complexity. In: Albert, J.L., Monien, B., Artalejo, M.R. (eds) Automata, Languages and Programming. ICALP 1991. Lecture Notes in Computer Science, vol 510. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54233-7_168

Download citation

  • DOI: https://doi.org/10.1007/3-540-54233-7_168

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-54233-9

  • Online ISBN: 978-3-540-47516-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation