Proof — Yao's principle

Statement

Communication complexity; pseudorandomness; cryptography. Proved in ZFC.

Source

ACM Turing Award 2000. Communication complexity; pseudorandomness; cryptography. Proved in ZFC.

Domains

computer-science

People

Related

Explore

Canonical: https://axiom.tanaakk.com/proof/yao-turing-2000/