The Power and Weakness of Randomness When You Are Short on Time
Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only! Grab it Explore the power and limitations of randomness in computational algorithms through this Rothschild Lecture delivered by Professor Avi Wigderson from the Institute for Advanced Study Princeton. Delve into the centuries-long human fascination with randomness and its applications, focusing on the significant advancements made in the Theory of Computation over the past three decades. Examine two primary aspects of randomness research, demonstrating its strengths and weaknesses in enhancing algorithmic efficiency. Gain insights into the role of randomness in various computational contexts, including space-bounded computation, probabilistic proofs, and zero-knowledge proofs, as time allows.