Construct · 1 fields · 1 citations

hardness versus randomness: a standalone construct

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

● anchor · a standalone construct Nearest construct by meaning·not indexed
hardness versusrandomness1 CONSTRUCTHardness versusNISAN · 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 principle that sufficiently hard functions can be turned into pseudorandom generators, so computational hardness lets randomized algorithms be derandomized.

In computational complexity, hardness versus randomness refers to the principle that sufficiently hard functions can be turned into pseudorandom generators, so computational hardness lets randomized algorithms be derandomized. This meaning comes from Nisan (1994) 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 hardness versus randomness 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

complexity4 fields · 7 citationsjingle · one word, four constructshardness4 fields · 4 citationsjingle · one word, four constructs

References

  1. Nisan, N., & Wigderson, A. (1994). Hardness vs randomness. Journal of Computer and System Sciences, 49(2), 149-167. https://doi.org/10.1016/s0022-0000(05)80043-1

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