External Links

    Journal: Computational Complexity

    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