Image de couverture de livre

A Critique of Deng's "P=NP"

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Humphreys, Isabel, Iceland, Matthew, Liuson, Harry, McKellips, Dylan, Sciortino, Leo
Format:	Preprint
Publié:	2025
Sujets:	Computational Complexity
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

A Critique of Du's "A Polynomial-Time Algorithm for 3-SAT
par: He, Yumeng, et autres
Publié: (2024)

A Critique of Lin's "On $\text{NP}$ versus $\text{coNP}$ and Frege Systems"
par: DeJesse, Nicholas, et autres
Publié: (2025)

P=NP
par: Deng, Zikang
Publié: (2024)

P vs. NP
par: Uribe, Daniel
Publié: (2016)

On P Versus NP
par: Gordeev, Lev
Publié: (2020)

A proof of P!=NP
par: McCallum, Rupert
Publié: (2020)

Symmetric Locality: Definition and Initial Results
par: Escalona, Giordan, et autres
Publié: (2024)

Some conditions implying if P=NP then P=PSPACE
par: Rodriguez, Ismael
Publié: (2026)

NATO and the institutional reform of the Colombian armed forces
par: Andrew I. G. McKellips
Publié: (2024)

The $\text{FP}^\text{NP}$ versus #P dichotomy for #EO
par: Meng, Boning, et autres
Publié: (2025)

Topological Collapse: P = NP Implies #P = FP via Solution-Space Homology
par: Alasli, M.
Publié: (2026)

Scheme-theoretic Approach to Computational Complexity I. The Separation of P and NP
par: Çivril, Ali
Publié: (2021)

Wataridori is NP-Complete
par: Ruangwises, Suthee
Publié: (2026)

Nondango is NP-Complete
par: Ruangwises, Suthee
Publié: (2023)

On $NP \cap coNP$ proof complexity generators
par: Krajicek, Jan
Publié: (2025)

Proofs of NP = coNP = PSPACE: Current upgrade
par: Gordeev, Lev, et autres
Publié: (2023)

BusOut is NP-complete
par: Ishibashi, Takehiro, et autres
Publié: (2025)

Communication Complexity is NP-hard
par: Hirahara, Shuichi, et autres
Publié: (2025)

On Kernelization with Access to NP-Oracles
par: Molter, Hendrik, et autres
Publié: (2025)

NP-Completeness of Neighborhood Balanced Colorings
par: Asaeedi, Saeed
Publié: (2024)

The 2-Attractor Problem is NP-Complete
par: Fuchs, Janosch, et autres
Publié: (2023)

An Intrinsic Barrier for Resolving P = NP (2-SAT as Flat, 3-SAT as High-Dimensional Void-Rich)
par: Alasli, M.
Publié: (2025)

NP-Completeness of Multicast Beamforming in Wireless Communication
par: Shrestha, Sagar
Publié: (2025)

A Critique of Quigley's "A Polynomial Time Algorithm for 3SAT"
par: DeJesse, Nicholas, et autres
Publié: (2025)

Scheme-theoretic Approach to Computational Complexity II. The Separation of P and NP over $\mathbb{C}$, $\mathbb{R}$, and $\mathbb{Z}$
par: Çivril, Ali
Publié: (2021)

There is a Hyper-Greedoid lurking behind every Graphical Accessible Computational Search Problem solvable in Polynomial Time: $P \not= NP$
par: Kayibi, Koko-Kalambay Kalafan
Publié: (2018)

A Critique of Chen's "The 2-MAXSAT Problem Can Be Solved in Polynomial Time"
par: Le, Tran Duy Anh, et autres
Publié: (2024)

Optimizing for aggressive-style strategies in Flesh and Blood is NP-hard
par: Romão, Leonardo Gasparini, et autres
Publié: (2025)

On the NP-Hardness Approximation Curve for Max-2Lin(2)
par: Martinsson, Björn
Publié: (2024)

Limits of structures and Total NP Search Problems
par: Ježil, Ondřej
Publié: (2023)

A Brief Note on a Recent Claim About NP-Hard Problems and BQP
par: Chavrimootoo, Michael C.
Publié: (2024)

The 7 faces of quantum NP
par: Gharibian, Sevag
Publié: (2023)

Towards Solving NP-Complete and Other Hard Problems Efficiently in Practice
par: Digulescu, Mircea-Adrian
Publié: (2026)

An Oracle with no $\mathrm{UP}$-Complete Sets, but $\mathrm{NP}=\mathrm{PSPACE}$
par: Dingel, David, et autres
Publié: (2024)

Limit-sure reachability for small memory policies in POMDPs is NP-complete
par: Asadi, Ali, et autres
Publié: (2024)

NP-hardness of testing equivalence to sparse polynomials and to constant-support polynomials
par: Baraskar, Omkar, et autres
Publié: (2024)

A proof of P != NP (New symmetric encryption algorithm against any linear attacks and differential attacks)
par: Ming, Gao
Publié: (2022)

Determining unit distance graphs with coordinates in $\mathbb{Z}^2$ is NP-complete
par: Binnendyk, Eric
Publié: (2025)

King Chasing Problem in Chinese Chess is NP-hard
par: Li, Chao, et autres
Publié: (2026)

A Quantale-Weakness Route to $P \neq NP$ via CD Evidence Normalization and Gauge-Buffered Locked Ensembles
par: Goertzel, Ben
Publié: (2025)