Skip to main content

Interactive computations of optimal solutions

  • Invited Lectures
  • Conference paper
  • First Online:
Mathematical Foundations of Computer Science 1990 (MFCS 1990)

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

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. L.Babai, Trading group theory for randomness, 17-th STOC, 1985, pp. 421–429.

    Google Scholar 

  2. S.Goldwasser, S.Michali, C.Rackoff, The knowledge complexity of interactive proof systems, 17-STOC, 1985, pp.291–304.

    Google Scholar 

  3. R.M.Karp, R.J.Lipton, Some connections between nonuniform and uniform complexity classes, 12-th STOC, 1980, pp.302–309.

    Google Scholar 

  4. J.Krajíček, P.Pudlák, G.Takeuti, Bounded Arithmetic and Polynomial Hierarchy, Annals of Pure an Applied Logic, to appear.

    Google Scholar 

  5. M.Krentel, The complexity of optimization problems, 18-th STOC, 1986, pp.69–75.

    Google Scholar 

  6. C.H.Papadimitriou, M.Yannakakis, Optimization, approximation, and complexity classes, 20-th STOC, 1988 pp.229–234.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Branislav Rovan

Rights and permissions

Reprints and permissions

Copyright information

© 1990 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Krajíček, J., Pudlák, P., Sgall, J. (1990). Interactive computations of optimal solutions. In: Rovan, B. (eds) Mathematical Foundations of Computer Science 1990. MFCS 1990. Lecture Notes in Computer Science, vol 452. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0029595

Download citation

  • DOI: https://doi.org/10.1007/BFb0029595

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-52953-8

  • Online ISBN: 978-3-540-47185-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics