The paper asserts NP-completeness for several bounded-appearance SAT variants, but a central gadget for the (k,1) monotone results fails to enforce the required constraints.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CC 1years
2019 1verdicts
REJECT 1representative citing papers
citing papers explorer
-
On simplified NP-complete variants of Not-All-Equal 3-Sat and 3-Sat
The paper asserts NP-completeness for several bounded-appearance SAT variants, but a central gadget for the (k,1) monotone results fails to enforce the required constraints.