NP-complete problems and physical reality

Aaronson, S. (2005). NP-complete problems and physical reality.

Type

Unclassified

Intellectual base

Unclassified

Year

2005

DOI

10.1145/1052796.1052804

Link

https://doi.org/10.1145/1052796.1052804

Cited by

1 citation across 1 artifact.

Domain-specific

• PSPACE
  • … and encoding, deterministic Turing-machine model, input length, counted workspace, polynomial bound, halting convention, reductions and class containments or completeness claim are explicit. to An applied instance preserves the same invariant under changed scale, notation, dataset, jurisdiction, or implementation..

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:dea2ede744d3 · see in the full table