Claims a proof that CLIQUE is not solvable in polynomial time on deterministic TMs, implying P ≠ NP.
Erd˝ os, R Rado, Intersection theorems for systems of sets , Journal of London Math
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.