2000 character limit reached
All instances of MONOTONE 3-SAT-(3,1) are satisfiable
Published 11 Nov 2023 in cs.CC | (2311.06563v2)
Abstract: The satisfiability problem is NP-complete but there are subclasses where all the instances are satisfiable. For this, restrictions on the shape of the formula are made. Darman and D\"ocker show that the subclass MONOTONE $3$-SAT-($k$,1) with $k \geq 5$ proves to be NP-complete and pose the open question whether instances of MONOTONE $3$-SAT-(3,1) are satisfiable. This paper shows that all instances of MONOTONE $3$-SAT-(3,1) are satisfiable using the new concept of a color-structures.
- Stephen A. Cook “The Complexity of Theorem-Proving Procedures” In Proceedings of the Third Annual ACM Symposium on Theory of Computing, STOC ’71 Shaker Heights, Ohio, USA: Association for Computing Machinery, 1971, pp. 151–158 DOI: 10.1145/800157.805047
- “On simplified NP-complete variants of Monotone 3-Sat” In Discrete Applied Mathematics 292, 2021, pp. 57
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.