1. Derandomizing Polynomial Identity Tests Means Proving Circuit Lower Bounds

   • Valentine Kabanets
   • Russell Impagliazzo

   Original Paper Pages: 1 - 46

2. Non-Automatizability of Bounded-Depth Frege Proofs

   • Maria Luisa Bonet
   • Carlos Domingo
   • Toniann Pitassi

   Original Paper Pages: 47 - 68

3. Recursion Schemata for Slowly Growing Depth Circuit Classes

   • Satoru Kuroda

   Original Paper Pages: 69 - 89