External Links

    Journal: Computational Complexity

    Volume 11, Issue 3-4

    91 -- 108Josh Buresh-Oppenheim, Matthew Clegg, Russell Impagliazzo, Toniann Pitassi. Homogenization and the polynomial calculus
    109 -- 136Eli Ben-Sasson. Hard examples for the bounded depth Frege proof system
    137 -- 157Lance Fortnow, John D. Rogers. Separability and one-way functions
    158 -- 170Bruno Codenotti, Igor Shparlinski, Arne Winterhof. On the hardness of approximating the permanent of structured matrices

    Volume 11, Issue 1-2

    1 -- 53Oded Goldreich, Salil P. Vadhan, Avi Wigderson. On interactive proofs with a laconic prover
    54 -- 89Carsten Damm, Markus Holzer, Pierre McKenzie. The complexity of tensor calculus
    runs on