External Links

    Journal: Computational Complexity

    Volume 19, Issue 2

    151 -- 152Johan Håstad. Special Issue Conference on Computational Complexity 2009 Guest Editor s Foreword
    153 -- 181Nikos Leonardos, Michael Saks. Lower Bounds on the Randomized Communication Complexity of Read-Once Functions
    183 -- 210Kazuyuki Amano. ::::k::::-Subgraph Isomorphism on AC:::0::: Circuits
    211 -- 234Kristoffer Arnsfelt Hansen, Michal Koucký. A New Characterization of ACC:::0::: and Probabilistic CC:::0:::
    235 -- 263Parikshit Gopalan, Amir Shpilka, Shachar Lovett. The Complexity of Boolean Functions in Different Characteristics
    265 -- 304Guy N. Rothblum, Salil P. Vadhan. Are PCPs Inherent in Efficient Arguments?
    305 -- 332Akitoshi Kawamura. Lipschitz Continuous Ordinary Differential Equations are Polynomial-Space Complete
    runs on