Google, IBM & Meta Certificates – 40% Off
One Coursera Plus subscription covers most Professional Certificates on Coursera.
Unlock All Certificates
This graduate lecture examines time-space tradeoffs for SAT and techniques for proving lower bounds, including alternation elimination, alternation trading, padding, and circuit-complexity arguments. It assumes substantial prior familiarity with computational complexity theory.
