pith. sign in

Title resolution pending

· 1985

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it
browse 1 citing papers

Title metadata for this work has not finished resolving. The hub is built from the citation graph; the title resolver retries DOI and OpenAlex on its next pass.

fields

cs.CC 1

years

2020 1

verdicts

UNVERDICTED 1

representative citing papers

On P Versus NP

cs.CC · 2020-05-02 · unverdicted · novelty 7.0

Claims a proof that CLIQUE is not solvable in polynomial time on deterministic TMs, implying P ≠ NP.

citing papers explorer

Showing 1 of 1 citing paper.

  • On P Versus NP cs.CC · 2020-05-02 · unverdicted · none · ref 5

    Claims a proof that CLIQUE is not solvable in polynomial time on deterministic TMs, implying P ≠ NP.