External Links

    Journal: Computational Complexity

    Volume 10, Issue 4

    261 -- 276Maria Luisa Bonet, Nicola Galesi. Optimality of size-width tradeoffs for resolution
    277 -- 296Anna Gál. A characterization of span program size and improved lower bounds for monotone span programs
    297 -- 313Matthias Krause, Stefan Lucks. Pseudorandom functions in TC:::0::: and cryptographic limitations to proving lower bounds
    314 -- 315Ilan Kremer, Noam Nisan, Dana Ron. Errata for: On randomized one-round communication complexity

    Volume 10, Issue 3

    179 -- 209Søren Riis. A complexity gap for tree resolution
    210 -- 246Jeff Edmonds, Russell Impagliazzo, Steven Rudich, Jiri Sgall. Communication complexity towards lower bounds on circuit depth
    247 -- 259Chi-Jen Lu. Derandomizing Arthur-Merlin games under uniform assumptions

    Volume 10, Issue 2

    93 -- 116Harry Buhrman, Stephen A. Fenner, Lance Fortnow, Leen Torenvliet. Two oracles that force a big crunch
    117 -- 138Manindra Agrawal, Eric Allender, Russell Impagliazzo, Toniann Pitassi, Steven Rudich. Reducing the complexity of reductions
    139 -- 154Dima Grigoriev. Complexity of Positivstellensatz proofs for the knapsack
    155 -- 178Martin Sauerhoff. On the size of randomized OBDDs and read-once branching programs for k-stable functions

    Volume 10, Issue 1

    1 -- 27Amir Shpilka, Avi Wigderson. Depth-3 arithmetic circuits over fields of characteristic zero
    28 -- 40Hana Chockler, Uri Zwick. Which bases admit non-trivial shrinkage of formulae?
    41 -- 69Mark Giesbrecht. Fast computation of the Smith form of a sparse integer matrix
    70 -- 91Christoph Meinel, Stephan Waack. The log rank conjecture for modular communication complexity
    runs on