Non-deterministic polynomial optimization problems and their approximation

Abridged version
  • A. Paz
  • S. Moran
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 52)


  1. [Co 71]
    S.A. Cook: "The Complexity of Theorem Proving Procedures", 3-rd STOC (1971), pp. 151–158.Google Scholar
  2. [GJS 74]
    M.R. Garey, D.S. Johnson, L. Stockmeyer: "Some Simplified NP-Complete Problems", 6-th STOC (1974), pp. 47–63.Google Scholar
  3. [Jo 73]
    D.S. Johnson: "Approximation Algorithms for Combinatorial Problems", 5-th STOC (1973), pp. 38–49.Google Scholar
  4. [Ka 72]
    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.Google Scholar
  5. [PS 76]
    C.H. Papadimitriou and K. Steiglitz: "Some Complexity Results for the TSP", 8th STOC (1976), pp. 1–9.Google Scholar
  6. [Sa 76]
    S. Sahni: "General Techniques for Combinatorial Approximation". TR 76-6, University of Minnesota, Dept. of Computer Sciences.Google Scholar
  7. [S 73]
    L. Stockmayer: "Planar 3-Colorability is NP Complete", SIGACT News, 5, No. 3, (1973), pp. 19–26.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1977

Authors and Affiliations

  • A. Paz
    • 1
  • S. Moran
    • 2
  1. 1.Dept. of Computer ScienceTECHNION-Israel Institute of TechnologyIsrael
  2. 2.Dept. of MathematicsTECHNION-Israel Institute of TechnologyIsrael

Personalised recommendations