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
Communication complexity; pseudorandomness; cryptography. Proved in ZFC.
ACM Turing Award 2000. Communication complexity; pseudorandomness; cryptography. Proved in ZFC.
computer-science
Canonical: https://axiom.tanaakk.com/theorem/yao-turing-2000/