A simplified NP-complete satisfiability problem
- 1 April 1984
- journal article
- research article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 8 (1) , 85-89
- https://doi.org/10.1016/0166-218x(84)90081-7
Abstract
No abstract availableThis publication has 3 references indexed in Scilit:
- The Euclidean travelling salesman problem is NP-completeTheoretical Computer Science, 1977
- On the Complexity of Timetable and Multicommodity Flow ProblemsSIAM Journal on Computing, 1976
- On Representatives of SubsetsJournal of the London Mathematical Society, 1935