Skip to main content
SpringerLink
Log in

On the reduction theory for average case complexity

  • Conference paper
  • First Online:
Computer Science Logic (CSL 1990)

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

Included in the following conference series:

Abstract

This is an attempt to simplify and justify the notions of deterministic and randomized reductions, an attempt to derive these notions from (more or less) first principles.

Partially supported by NSF grant DMR 88-01988.

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. Yuri Gurevich, “Average Case Complexity”, J. Computer and System Sciences (a special issue on FOCS'87) to appear.

    Google Scholar 

  3. Yuri Gurevich, “Matrix Decomposition Problem is Complete for the Average Case”, Symposium on Foundations of Computer Science, IEEE Computer Society Press, 1990, 802–811.

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

  6. Leonid A. Levin, “Average Case Complete Problems”, SIAM Journal of Computing, 1986.

    Google Scholar 

  7. 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 

Download references

Author information

Authors and Affiliations

  1. Mathematics Department, University of Michigan, 48109-1003, Ann Arbor, MI, USA

    Andreas Blass

  2. Electrical Engineering and Computer Science Department, University of Michigan, 48109-2122, Ann Arbor, MI, USA

    Yuri Gurevich

Authors
  1. Andreas Blass
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yuri Gurevich
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Egon Börger Hans Kleine Büning Michael M. Richter Wolfgang Schönfeld

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Blass, A., Gurevich, Y. (1991). On the reduction theory for average case complexity. In: Börger, E., Kleine Büning, H., Richter, M.M., Schönfeld, W. (eds) Computer Science Logic. CSL 1990. Lecture Notes in Computer Science, vol 533. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54487-9_50

Download citation

  • DOI: https://doi.org/10.1007/3-540-54487-9_50

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-54487-6

  • Online ISBN: 978-3-540-38401-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation