External Links

    Journal: Computational Complexity

    Volume 21, Issue 2

    193 -- 195Anup Rao. Special Issue "Conference on Computational Complexity 2011" Guest Editor's Foreword
    197 -- 244Andrew Drucker. Improved direct product theorems for randomized query complexity
    245 -- 266Shachar Lovett, Emanuele Viola. Bounded-Depth Circuits Cannot Sample Good Codes
    267 -- 309Eli Ben-Sasson, Michael Viderman. Towards lower bounds on locally testable codes via density arguments
    311 -- 358Eric Blais, Joshua Brody, Kevin Matulef. Property Testing Lower Bounds via Communication Complexity
    runs on