Construct · 1 fields · 1 citations

VP versus VNP: a standalone construct

One name. One construct. A landmark on the map.

● anchor · a standalone construct Nearest construct by meaning·not indexed

A single standalone construct; nearby constructs are located against it in the Collider. Tap a field for its definition, unit, and measures.

Computational complexity

the algebraic counterpart of P versus NP asking whether polynomials like the permanent need superpolynomial-size arithmetic circuits.

In computational complexity, VP versus VNP refers to the algebraic counterpart of P versus NP asking whether polynomials like the permanent need superpolynomial-size arithmetic circuits. This meaning comes from Valiant (1979) in Proceedings of the eleventh annual ACM symposium on Theory of computing - STOC '79.[1]

Unit
Recovery means
Measured by

Run it through the Collider, or take the citations with you.

See how VP versus VNP sits against neighbouring constructs in the Collider, or export every reference on this page in one click.

Open in Collider Export BibTeX Report this entry

Nearby constructs

complexity4 fields · 7 citationsjingle · one word, four constructs need3 fields · 4 citationsjingle · one word, three constructs P versus NP problem1 fields · 1 citationsanchor · a standalone construct

References

Valiant, L. G. (1979). Completeness classes in algebra. Proceedings of the eleventh annual ACM symposium on Theory of computing - STOC '79. https://doi.org/10.1145/800135.804419

Cited on this page?

Confirm your construct, or correct us.

If your work is cited behind one of these entries, you know better than we do whether we captured the meaning right. Confirm it, suggest an edit, or dispute it, and your name goes on the entry as an author who has checked it, linked to your ORCID.

Claim your construct