External Links

    Journal: Computational Complexity

    Volume 19, Issue 4

    477 -- 499Noam Livne. All Natural NP-Complete Problems Have Average-Case Complete Versions
    501 -- 519Eli Ben-Sasson, Russell Impagliazzo. Random Cnf s are Hard for the Polynomial Calculus
    521 -- 558Vikraman Arvind, Partha Mukhopadhyay, Srikanth Srinivasan. New Results on Noncommutative and Commutative Polynomial Identity Testing
    559 -- 580Thanh Minh Hoang, Thomas Thierauf. The Complexity of the Inertia
    581 -- 604Adam R. Klivans, Alexander A. Sherstov. Lower Bounds for Agnostic Learning via Approximate Rank
    605 -- 633Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum. A Complexity Dichotomy For Hypergraph Partition Functions

    Volume 19, Issue 3

    333 -- 354Mark Giesbrecht, Daniel S. Roche. Interpolation of Shifted-Lacunary Polynomials
    355 -- 366Erich Kaltofen, Mark Lavin. Efficiently Certifying Non-Integer Powers
    367 -- 422Dana Moshkovitz, Ran Raz. Sub-Constant Error Probabilistically Checkable Proof of Almost-Linear Size
    423 -- 475Jeff Kinne, Dieter van Melkebeek. Space Hierarchy Results for Randomized and other Semantic Models

    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

    Volume 19, Issue 1

    1 -- 35Peter Bürgisser, Peter Scheiblechner. Counting Irreducible Components of Complex Algebraic Varieties
    37 -- 56Jin-yi Cai, Xi Chen, Dong Li. Quadratic Lower Bound for Permanent Vs. Determinant in any Characteristic
    57 -- 98Vikraman Arvind, T. C. Vijayaraghavan. Classifying Problems on Linear Congruences and Abelian Permutation Groups Using Logspace Counting Classes
    99 -- 133Oded Goldreich, Or Sheffet. On The Randomness Complexity of Property Testing
    135 -- 150Alexander A. Sherstov. Communication Complexity Under Product and Nonproduct Distributions
    runs on