External Links

    Journal: Computational Complexity

    Volume 13, Issue 1-2

    1 -- 46Valentine Kabanets, Russell Impagliazzo. Derandomizing Polynomial Identity Tests Means Proving Circuit Lower Bounds
    47 -- 68Maria Luisa Bonet, Carlos Domingo, Ricard Gavaldà, Alexis Maciel, Toniann Pitassi. Non-Automatizability of Bounded-Depth Frege Proofs
    69 -- 89Satoru Kuroda. Recursion Schemata for Slowly Growing Depth Circuit Classes
    runs on