22. PPAD

Daskalakis, C. (2015). 22. PPAD.

Type

Unclassified

Intellectual base

Unclassified

Year

2015

Link

no authoritative link yet

Cited by

1 citation across 1 artifact.

Domain-specific

• FNP (complexity)
  • FNP is formally a class of binary relations or multivalued search problems rather than ordinary single-valued functions, verification does not imply efficient solution discovery and total subclasses such as TFNP add an existence guarantee.

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