2000 character limit reached
A Critique of Du's "A Polynomial-Time Algorithm for 3-SAT
Published 5 Apr 2024 in cs.CC | (2404.04395v1)
Abstract: In this paper, we examine the claims made by the paper "A polynomial-time algorithm for 3-SAT" by Lizhi Du. The paper claims to provide a polynomial-time algorithm for solving the NP-complete problem 3-SAT. In examining the paper's argument, we find a flaw in one of the main sections of its algorithm. We argue that this flaw causes the paper's algorithm to incorrectly decide that an infinite family of satisfiable 3-CNF boolean formulas are not satisfiable. Therefore, the paper does not establish that P = NP.
- B. Berger and T. Leighton. Protein folding in the hydrophobic-hydrophilic (HP) model is NP-complete. Journal of Computational Biology, 5(1):27–40, 1998.
- L. Du. A polynomial time algorithm for 3-SAT. Technical Report arXiv:1004.3702 [cs.CC], Computing Research Repository, arXiv.org/corr/, April 2010. Revised October, 2023.
- R. Karp. Reducibilities among combinatorial problems. In Complexity of Computer Computations, pages 85–103, 1972.
- F. Massacci and L. Marraro. Logical cryptanalysis as a SAT problem. Journal of Automated Reasoning, 24:165–203, 2000.
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.