Claims a proof of P ≠ NP via contradiction between O(1) and Ω(t) bounds on polynomial conditional Kolmogorov complexity for a specially constructed family of SAT instances.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CC 1years
2025 1verdicts
REJECT 1representative citing papers
citing papers explorer
-
A Quantale-Weakness Route to $P \neq NP$ via CD Evidence Normalization and Gauge-Buffered Locked Ensembles
Claims a proof of P ≠ NP via contradiction between O(1) and Ω(t) bounds on polynomial conditional Kolmogorov complexity for a specially constructed family of SAT instances.