A simplified NP-complete MAXSAT problem
- 15 January 1998
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 65 (1) , 1-6
- https://doi.org/10.1016/s0020-0190(97)00223-8
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Some simplified NP-complete graph problemsPublished by Elsevier ,2002
- The Minimum Satisfiability ProblemSIAM Journal on Discrete Mathematics, 1994
- One More Occurrence of Variables Makes Satisfiability Jump from Trivial to NP-CompleteSIAM Journal on Computing, 1993
- On the complexity of the maximum satisfiability problem for horn formulasInformation Processing Letters, 1987
- Solving satisfiability in less than 2n stepsDiscrete Applied Mathematics, 1985
- A simplified NP-complete satisfiability problemDiscrete Applied Mathematics, 1984
- The Euclidean travelling salesman problem is NP-completeTheoretical Computer Science, 1977