Showing cs.CCShow all
3 papers · 1 filter
cs.CC2025
A Critique of Deng's "P=NP"
Isabel Humphreys, Matthew Iceland, Harry Liuson +2
In this paper, we critically examine Deng's "P=NP" [Den24]. The paper claims that there is a polynomial-time algorithm that decides 3-coloring for graphs with vertices of degree at…
cs.CC2024
A Critique of Du's "A Polynomial-Time Algorithm for 3-SAT
Yumeng He, Matan Kotler-Berkowitz, Harry Liuson +1
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…
cs.CC2023
Evaluating the Claims of "SAT Requires Exhaustive Search"
Michael C. Chavrimootoo, Yumeng He, Matan Kotler-Berkowitz +2
In this paper, we take a closer look at the claims made by Xu and Zhou in their paper "SAT Requires Exhaustive Search" [XZ23], which claims to provide a lower bound on the complexi…