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

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
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

An Inefficiently Efficient Algorithm For Monotone NAE 3-SAT Problem

Letong Dai
Zenodo (CERN European Organization for Nuclear Research)
Complexity and Algorithms in Graphs
preprint

An Inefficiently Efficient Algorithm For Monotone NAE 3-SAT Problem

Letong Dai
preprint en

Abstract

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.

Zenodo (CERN European Organization for Nuclear Research)
Complexity and Algorithms in Graphs
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon