Chapter PDF
Bibliography
S.A. Cook: "The Complexity of Theorem Proving Procedures", 3-rd STOC (1971), pp. 151–158.
M.R. Garey, D.S. Johnson, L. Stockmeyer: "Some Simplified NP-Complete Problems", 6-th STOC (1974), pp. 47–63.
D.S. Johnson: "Approximation Algorithms for Combinatorial Problems", 5-th STOC (1973), pp. 38–49.
R.M. Karp: "Reducibility among Combinational Problems", Complexity of Computer Computations, R.E. Miller & J.W. Thatcher (eds.) Plenum Press, N.Y. (1972), pp. 85–104.
C.H. Papadimitriou and K. Steiglitz: "Some Complexity Results for the TSP", 8th STOC (1976), pp. 1–9.
S. Sahni: "General Techniques for Combinatorial Approximation". TR 76-6, University of Minnesota, Dept. of Computer Sciences.
L. Stockmayer: "Planar 3-Colorability is NP Complete", SIGACT News, 5, No. 3, (1973), pp. 19–26.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1977 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Paz, A., Moran, S. (1977). Non-deterministic polynomial optimization problems and their approximation. In: Salomaa, A., Steinby, M. (eds) Automata, Languages and Programming. ICALP 1977. Lecture Notes in Computer Science, vol 52. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-08342-1_29
Download citation
DOI: https://doi.org/10.1007/3-540-08342-1_29
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-08342-9
Online ISBN: 978-3-540-37305-6
eBook Packages: Springer Book Archive