Claims a proof that CLIQUE is not solvable in polynomial time on deterministic TMs, implying P ≠ NP.
Tardos, The gap between monotone and non-monotone circuit complexi ty is exponential , Combinatorica 8:1, 141–142 (1988)
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.