This is a preview of subscription content, log in via an institution to check access.
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
(1995). Conclusions. In: Sudan, M. (eds) Efficient Checking of Polynomials and Proofs and the Hardness of Appoximation Problems. Lecture Notes in Computer Science, vol 1001. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60615-7_6
Download citation
DOI: https://doi.org/10.1007/3-540-60615-7_6
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60615-4
Online ISBN: 978-3-540-48485-1
eBook Packages: Springer Book Archive