A simplified NP-complete MAXSAT problem
References (10)
- et al.
Some simplified NP-complete graph problems
Theoret. Comput. Sci.
(1976) - et al.
On the complexity of the Maximum Satisfiability problem for horn formulas
Inform. Process. Lett.
(1987/1988) - et al.
Solving satisfiability in less than 2n steps
Discrete Appl. Math.
(1985) The Euclidean traveling salesman problem is NP-complete
Theoret. Comput. Sci.
(1977)A simplified NP-complete satisfiability problem
Discrete Appl. Math.
(1984)
There are more references available in the full text version of this article.
Cited by (54)
Algorithms for (n,3)-MAXSAT and parameterization above the all-true assignment
2020, Theoretical Computer ScienceResolution and linear CNF formulas: Improved (n,3)-MAXSAT algorithms
2019, Theoretical Computer ScienceNetwork design with a discrete set of traffic matrices
2013, Operations Research LettersPopular spanning trees
2013, International Journal of Foundations of Computer ScienceOn Star Partition of Split Graphs
2024, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)Improved Algorithms for Maximum Satisfiability and Its Special Cases
2023, Proceedings of the 37th AAAI Conference on Artificial Intelligence, AAAI 2023
Copyright © 1998 Published by Elsevier B.V.