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 the concept of matrix rigidity and its applications in communication complexity and circuit lower bounds in this 21-minute IEEE conference talk. Delve into Williams' algorithmic approach to circuit lower bounds and learn about bootstrapping low-rank approximations. Gain insights from speakers Josh Alman and Lijie Chen as they discuss efficient construction methods for rigid matrices using an NP oracle.
