P vs NP Problem {{!

P vs NP Problem {{!.

Type

Unclassified

Intellectual base

Unclassified

Link

no authoritative link yet

Cited by

1 citation across 1 artifact.

Domain-specific

• Computational complexity theory
  • Complexity theory defines input encodings, resource measures such as time, space, randomness, or communication, and classes of problems solvable within asymptotic bounds.

Verification

This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.

Registry ID ref:e84ada95859e · see in the full table