Logical definability of NP optimization problems

Information and Computation

Volumn 115, Issue 2, 1994, Pages 321-353

  Kolaitis, Phokion G ^a   Thakur, Madhukar N ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0001411224     PISSN: 08905401     EISSN: 10902651     Source Type: Journal    
DOI: 10.1006/inco.1994.1100     Document Type: Article

References (25)

1. Ausiello, G., D'Atri, A., and Protasi, M. (1980), Structure preserving reductions among convex optimization problems, J. Comput. System Sci. 21, 136-153
2. Arora, S., Lund, C., Motwani, R., Sudan, M., and Szegedy, M. (1992), Proof verification and intractability of approximation problems, in "Proceedings, 33rd IEEE Symposium on Foundations of Computer Science."
3. Arora, S., and Safra, S. (1992), Approximaing clique is NP-complete, in "Proceedings 33rd IEEE Symposium on Foundations of Computer Science.
4. Berman, L., and Hartmanis, J. (1977), On isomorphisms and density of NP and other complete sets, SI AM J. Comput. 6, No. 2, 305-322
5. Brushi, D., Joseph, D., and Young, P. (1989), A Structural Overview of NP Optimization Problems," Technical Report 861, Department of Computer Science, University of Wisconsin, Madison.
6. Chandra, A., and Harel, D. (1982), Structure and complexity of relational queries, J. Comput. System Sci. 25, 99-128.
7. Crescenzi, P., and Panconesi, A. (1991), Completeness in approximation classes, Inform, and Comput. 93, 241-262.
8. Crescenzi, P., and Panconesi, A. (1991), First appeard in "Proceedings of FCT'89," Lecture Notes in Computer Science, Vol. 380, Springer-Verlag, Berlin/New York.
9. Enderton, H. (1972), "A Mathematical Introduction to Logic," Academic Press, New York.
10. R. Fagin, (1974), Generalized first-order spectra and polynomial time recognizable sets, in "Complexity of Computations" (R. Karp, Ed.), pp. 43-73, SIAM-AMS Proceedings, Vol. 7.
11. Garey, M. R., and Johnson, D. (1979), Computers and Intractability: A Guide to the Theory of NP-Completeness," Freeman, San Francisco.
12. Johnson, D. (1974), Approximation algorithms for combinatorial problems, Comput. System Sci. 9, 256-278.
13. Krentel, M. (1988), The complexity of optimization problems, J. Comput. System Sci. 36, 490-509.
14. Kolaitis, Ph. G., and Thakur M. N. (1991), Approximation properties of NP minimization classes, in "Proceedings, Structure in Complexity Theory, Sixth Annual Conference," pp. 353-366, Full paper to appear in J. Comput. System Sci.
15. Kolaitis, Ph. G., and Vardi, M. Y. (1987), The decision problem for the probabilities of higher-order properties, in "Proceedings, 19th ACM Symposium on Theory of Computing," pp. 425-435.
16. Leggett, E., and Moore, J. (1981), Optimization problems and the polynomial time hierarchy, Theoret. Comput. Sci. 15, 279-289.
17. Orponen, P., and Manila, H. (1990), "On Approximation Preserving Reductions: Complete Problems and Robust Measures," Technical Report, University of Helsinki.
18. Paz, A., and Moran S. (1981), Non-determinismtic polynomial optimization problems and their approximation, Theoret. Comput. Sci. 15, 251-257.
19. Panconesi, A., and Ranjan, D. Quantifiers and Approximation, in "Proceedings, 22nd Annual ACM Symposium on Theory of Computing."
20. Papadimitriou, C., and Steiglitz, K. (1982), "Combinatorial Optimization—Algorithms and Complexity," Prentice-Hall, Englewood Cliffs, NJ.
21. Papadimitriou, C., and Yannakakis, M. (1990), The travelling salesman problem with distance one and two, unpublished manuscript.
22. Papadimitriou, C., and Yannakakis, M. (1991), Optimization, approximation and complexity classes, J. Comput. System Sci. 43, 425-440.
23. Papadimitriou, C., and Yannakakis, M. (1991), First appeared in "Proceedings, 20th Annual ACM Symposium on Theory of Computing," 1988.
24. Stockmeyer, L. J. (1976), The polynomial time hierarcy, Theoret. Comput. Sci. 3, 1-22.
25. Wagner, K. (1986), More complicated questions about maxima and minima, and some closure properties of NP, Theoret. Comput. Sci. 51, 53-80.