Non-deterministic polynomial optimization problems and their approximation
- 1 January 1977
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 370-379
- https://doi.org/10.1007/3-540-08342-1_29
Abstract
No abstract availableThis publication has 5 references indexed in Scilit:
- Some simplified NP-complete problemsPublished by Association for Computing Machinery (ACM) ,1974
- Planar 3-colorability is polynomial completeACM SIGACT News, 1973
- Approximation algorithms for combinatorial problemsPublished by Association for Computing Machinery (ACM) ,1973
- Reducibility among Combinatorial ProblemsPublished by Springer Nature ,1972
- The complexity of theorem-proving proceduresPublished by Association for Computing Machinery (ACM) ,1971