Claims a proof that CLIQUE is not solvable in polynomial time on deterministic TMs, implying P ≠ NP.
■ 17 5 Appendix B We have ℓ =m 1 8, p =ℓlog2m, L = (p − 1)ℓℓ!, k :=m 1 4, m ≫ 0
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CC 1years
2020 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
On P Versus NP
Claims a proof that CLIQUE is not solvable in polynomial time on deterministic TMs, implying P ≠ NP.