Google, IBM & Meta Certificates — All 10,000+ Courses at 40% Off
One annual plan covers every course and certificate on Coursera. 40% off for a limited time.
Get Full Access
Explore a 29-minute conference talk examining the theoretical foundations of derandomization in computational complexity theory. Learn about cutting-edge research on achieving "free lunch" derandomization through necessary assumptions and one-way functions (OWFs), presented by Roei Tell in collaboration with Marshall Ball and Lijie Chen. Discover how this work advances our understanding of the relationship between randomness and computation, focusing on the minimal assumptions required to eliminate randomness from probabilistic algorithms without significant computational overhead. Gain insights into the latest developments in complexity theory that bridge the gap between theoretical necessity and practical derandomization techniques.
