Preview
Unable to display preview. Download preview PDF.
References
L.Babai, Trading group theory for randomness, 17-th STOC, 1985, pp. 421–429.
S.Goldwasser, S.Michali, C.Rackoff, The knowledge complexity of interactive proof systems, 17-STOC, 1985, pp.291–304.
R.M.Karp, R.J.Lipton, Some connections between nonuniform and uniform complexity classes, 12-th STOC, 1980, pp.302–309.
J.Krajíček, P.Pudlák, G.Takeuti, Bounded Arithmetic and Polynomial Hierarchy, Annals of Pure an Applied Logic, to appear.
M.Krentel, The complexity of optimization problems, 18-th STOC, 1986, pp.69–75.
C.H.Papadimitriou, M.Yannakakis, Optimization, approximation, and complexity classes, 20-th STOC, 1988 pp.229–234.
Author information
Authors and Affiliations
Editor information
Rights 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