Derandomizing Polynomial Identity Tests Means Proving Circuit Lower Bounds Valentine KabanetsRussell Impagliazzo Original Paper Pages: 1 - 46
Non-Automatizability of Bounded-Depth Frege Proofs Maria Luisa BonetCarlos DomingoToniann Pitassi Original Paper Pages: 47 - 68
Recursion Schemata for Slowly Growing Depth Circuit Classes Satoru Kuroda Original Paper Pages: 69 - 89