Construct · 1 fields · 1 citations

natural proofs barrier: a standalone construct

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

● anchor · a standalone construct Nearest construct by meaning·not indexed
naturalproofs barrier1 CONSTRUCTNatural proofs barrierRAZBOROV · COMPUTATIONAL

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 a broad class of circuit lower bound techniques cannot separate P from NP if strong pseudorandom functions exist.

In computational complexity, natural proofs barrier refers to the result that a broad class of circuit lower bound techniques cannot separate P from NP if strong pseudorandom functions exist. This meaning comes from Razborov (1997) in Journal of Computer and System Sciences.[1]

Unit
Recovery means
Measured by

Next

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

See how natural proofs barrier sits against neighbouring constructs in the Collider, or export every reference on this page in one click.

Open in ColliderExport BibTeXReport this entry

Nearby constructs

barrier4 fields · 7 citationsjingle · one word, four constructscircuit1 fields · 1 citationsanchor · a standalone constructclass3 fields · 3 citationsjingle · one word, three constructs

References

  1. Razborov, A. A., & Rudich, S. (1997). Natural Proofs. Journal of Computer and System Sciences, 55(1), 24-35. https://doi.org/10.1006/jcss.1997.1494

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