Construct · 1 fields · 1 citations

Valiant-Vazirani theorem: 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 result that satisfiability reduces by a randomized reduction to instances with at most one solution, so unique solutions are no easier.

In computational complexity, Valiant-Vazirani theorem refers to the result that satisfiability reduces by a randomized reduction to instances with at most one solution, so unique solutions are no easier. This meaning comes from Valiant (1986) in Theoretical Computer Science.[1]

Unit
Recovery means
Measured by

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

See how Valiant-Vazirani theorem 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 reduction5 fields · 5 citationsjingle · one word, five constructs satisfiability1 fields · 1 citationsanchor · a standalone construct

References

Valiant, L. G., & Vazirani, V. V. (1986). NP is as easy as detecting unique solutions. Theoretical Computer Science, 47, 85-93. https://doi.org/10.1016/0304-3975(86)90135-0

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