Construct · 1 fields · 1 citations

Yao's XOR lemma: 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 the XOR of a mildly hard function evaluated on many independent inputs becomes almost impossible to predict better than chance.

In computational complexity, Yao's XOR lemma refers to the result that the XOR of a mildly hard function evaluated on many independent inputs becomes almost impossible to predict better than chance. This meaning comes from Yao (1982) in 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).[1]

Unit
Recovery means
Measured by

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

See how Yao's XOR lemma 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

computational indistinguishability1 fields · 1 citationsanchor · a standalone construct chance4 fields · 6 citationsjingle · one word, four constructs complexity4 fields · 7 citationsjingle · one word, four constructs

References

Yao, A. C. (1982). Theory and application of trapdoor functions. 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982). https://doi.org/10.1109/sfcs.1982.45

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