Journal of Computer and System Sciences - 26th IEEE Conference on Foundations of Computer Science, October 21-23, 1985
Handbook of combinatorics (vol. 2)
An oracle-polynomial time augmentation algorithm for integer programming
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
0/1-Integer Programming: Optimization and Augmentation are Equivalent
ESA '95 Proceedings of the Third Annual European Symposium on Algorithms
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
Analyzing the Performance of Generalized Hill Climbing Algorithms
Journal of Heuristics
| Hi-index | 0.00 |
This paper examines the complexity of global verification for MAX-SAT, MAX-k-SAT (for k≥3), Vertex Cover, and Traveling Salesman Problem. These results are obtained by adaptations of the transformations that prove such problems to be NP-complete. The class of problems PGS is defined to be those discrete optimization problems for which there exists a polynomial time algorithm such that given any solution ω, either a solution can be found with a better objective function value or it can be concluded that no such solution exists and ω is a global optimum. This paper demonstrates that if any one of MAX-SAT, MAX-k-SAT (for k≥3), Vertex Cover, or Traveling Salesman Problem are in PGS, then P=NP.