Proof — Randomness in computation
Statement
Wigderson’s work on derandomization, zero-knowledge proofs, and hardness vs randomness reshaped complexity theory.
Formula
BPP vs P; expanders
Source
Canonical lineament aligned with TANAAKK IAS Faculty Emeriti index (2026); consult specialist monographs for full proofs.
Domains
mathematics, computer-science