External Links

    Journal: Computational Complexity

    Volume 21, Issue 4

    515 -- 572Zeev Dvir. Extractors for varieties
    573 -- 604Jin-yi Cai, Pinyan Lu, Mingji Xia. Holographic reduction, interpolation and hardness
    605 -- 642Leslie Ann Goldberg, Mark Jerrum. Inapproximability of the Tutte polynomial of a planar graph
    643 -- 670Aduri Pavan, Raghunath Tewari, N. V. Vinodchandran. On the power of unambiguity in log-space

    Volume 21, Issue 3

    359 -- 419Markus Bläser, Holger Dell, Mahmoud Fouz. Complexity and Approximability of the Cover Polynomial
    421 -- 429Jacek Pomykala, Bartosz Zralek. On reducing factorization to the discrete logarithm problem modulo a composite
    431 -- 477Henning Wunderlich. On a Theorem of Razborov
    479 -- 497Luis Filipe Coelho Antunes, Lance Fortnow, Alexandre Pinto, Andre Souto. Low-Depth Witnesses are Easy to Find
    499 -- 510Hugue Blier, Alain Tapp. A Quantum Characterization Of NP
    511 -- 513Hannah Alpert, Jennifer Iglesias. Length 3 Edge-Disjoint Paths Is NP-Hard

    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

    Volume 21, Issue 1

    1 -- 0Oded Goldreich, Salil P. Vadhan. Special issue from RANDOM'09: Editors' Foreword
    3 -- 61Jeff Kinne, Dieter van Melkebeek, Ronen Shaltiel. Pseudorandom Generators, Typically-Correct Derandomization, and Circuit Lower Bounds
    63 -- 81Ido Ben-Eliezer, Rani Hod, Shachar Lovett. Random low-degree polynomials are hard to approximate
    83 -- 127Andrej Bogdanov, Youming Qiao. On the security of Goldreich's one-way function
    129 -- 192Oded Goldreich, Michael Krivelevich, Ilan Newman, Eyal Rozenberg. Hierarchy Theorems for Property Testing
    runs on