An Inefficiently Efficient Algorithm For Monotone NAE 3-SAT Problem
In this paper, I propose a polynomial time algorithm to decide the monotone NAE 3-SAT problem,which is a NP-Complete problem.The algorithm reduces the $O(n)$ scale monotone NAE 3-SAT problem to another satisfaction problem with $O(n^2)$ scale.It then solves this problem in $O(mn^{10} + n^{16})$, where $m$ is the number of clausesin the original NAE problem.I also discuss some implications and possible improvements of this algorithm, including its implicationto a famous open problem.This is a preprint version. The argument has not been peer reviewed. The claimed result should not be treated as already established. Readers are welcome to examine the proof and report any flaws or gaps to me.
Authors
- Letong Dai
Publication Details
- Journal
- Zenodo (CERN European Organization for Nuclear Research)
- Published
- 2026-11-19
- DOI
- https://doi.org/10.5281/zenodo.24364548
- Primary Topic
- Complexity and Algorithms in Graphs
- Type
- preprint