1-In-3 Vs. Not-All-Equal: Dichotomy of a Broken Promise
LICS '24 Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science(2024)
Abstract
The 1-in-3 and Not-All-Equal satisfiability problems for Boolean CNF formulasare two well-known NP-hard problems. In contrast, the promise 1-in-3 vs.Not-All-Equal problem can be solved in polynomial time. In the present work, weinvestigate this constraint satisfaction problem in a regime where the promiseis weakened from either side by a rainbow-free structure, and establish acomplexity dichotomy for the resulting class of computational problems.
MoreTranslated text
AI Read Science
Must-Reading Tree
Example
![](https://originalfileserver.aminer.cn/sys/aminer/pubs/mrt_preview.jpeg)
Generate MRT to find the research sequence of this paper
Chat Paper
Summary is being generated by the instructions you defined