Coursera Flash Sale
40% Off Coursera Plus for 3 Months!
Grab it
Learn about pseudorandom bit generation for non-commutative programs in this 26-minute conference talk presented by Chin Ho Lee in collaboration with Emanuele Viola at the Fields Institute. Explore the theoretical foundations and applications of pseudorandomness in computational complexity theory, specifically focusing on how pseudorandom generators can be designed and analyzed for programs where the order of operations matters. Discover the mathematical techniques used to construct pseudorandom bits that can fool non-commutative computational models, and understand the implications for derandomization and complexity theory. Gain insights into cutting-edge research at the intersection of pseudorandomness, algebraic computation, and theoretical computer science through this specialized presentation from the computational complexity conference series.
