External Links

    Journal: Computational Complexity

    Volume 9, Issue 3-4

    157 -- 201Prahladh Harsha, Madhu Sudan. Small PCPs with low query complexity
    202 -- 246Marcos A. Kiwi, Carsten Lund, Daniel A. Spielman, Alexander Russell, Ravi Sundaram. Alternation in interaction
    247 -- 263Detlef Sieling. A separation of syntactic and nonsyntactic (1, +k)-branching programs

    Volume 9, Issue 2

    73 -- 112Markus Bläser. Lower bounds for the bilinear complexity of associative algebras
    113 -- 122Ran Raz. The BNS-Chung criterion for multi-party communication complexity
    123 -- 145Carme Àlvarez, Raymond Greenlaw. A compendium of problems complete for symmetric logarithmic space
    146 -- 155F. Blume. On the relation between entropy and the average complexity of trajectories in dynamical systems

    Volume 9, Issue 1

    1 -- 15Ramamohan Paturi, Michael E. Saks, Francis Zane. Exponential lower bounds for depth three Boolean circuits
    16 -- 38Frederic Green. A complex-number Fourier technique for lower bounds on the Mod-m degree
    39 -- 51Anna Bernasconi, Carsten Damm, Igor Shparlinski. The average sensitivity of square-freeness
    52 -- 72Catherine S. Greenhill. The complexity of counting colourings and independent sets in sparse graphs and hypergraphs
    runs on