Google, IBM & Meta Certificates – 40% Off
One Coursera Plus subscription covers most Professional Certificates on Coursera.
Unlock All Certificates
This lecture explains how fully explicit expander graphs can reduce the error of randomized algorithms while preserving or nearly preserving their random-bit usage. It analyzes a bipartite-expander method and introduces an expander random-walk approach for exponential error reduction.
