External Links

    Journal: Computational Complexity

    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