External Links

    Journal: Computational Complexity

    Volume 18, Issue 4

    495 -- 525Amir Shpilka. Constructions of Low-degree and Error-Correcting epsilon-Biased Generators
    527 -- 550Felipe Cucker, Paulin Jacobé de Naurois. Parallel Time and Quantifier Prefixes
    551 -- 575Pascal Koiran, Sylvain Perifel. VPSPACE and a Transfer Theorem over the Reals
    577 -- 600Emmanuel Briand, Rosa Orellana, Mercedes Rosas. Reduced Kronecker Coefficients and Counter-Examples to Mulmuley s Strong Saturation Conjecture SH
    601 -- 649Mark Braverman, Raghav Kulkarni, Sambuddha Roy. Space-Efficient Counting in Graphs on Surfaces

    Volume 18, Issue 3

    337 -- 375Emanuele Viola. On Approximate Majority and Probabilistic Time
    377 -- 412Nutan Limaye, Meena Mahajan, Jayalal M. N. Sarma. Upper Bounds for Monotone Planar Circuit Value and Variants
    413 -- 434Johan HÃ¥stad. On the Approximation Resistance of a Random Predicate
    435 -- 494Amos Beimel, Renen Hallak, Kobbi Nissim. Private Approximation of Clustering and Vertex Cover

    Volume 18, Issue 2

    169 -- 170Paul Beame, Amit Chakrabarti. Special Issue "Conference on Computational Complexity 2008" Guest Editors Foreword
    171 -- 207Ran Raz, Amir Yehudayoff. Lower Bounds and Separations for Constant Depth Multilinear Circuits
    209 -- 217Emanuele Viola. The Sum of ::::D:::: Small-Bias Generators Fools Polynomials of Degree ::::D::::
    219 -- 247Alexander A. Sherstov. Approximate Inclusion-Exclusion for Arbitrary Symmetric Functions
    249 -- 271Per Austrin, Elchanan Mossel. Approximation Resistant Predicates from Pairwise Independence
    273 -- 307Julia Kempe, Hirotada Kobayashi, Keiji Matsumoto, Thomas Vidick. Using Entanglement in Quantum Multi-Prover Interactive Proofs
    309 -- 336Troy Lee, Adi Shraibman. Disjointness is Hard in the Multiparty Number-on-the-Forehead Model

    Volume 18, Issue 1

    1 -- 58Zeev Dvir, Ariel Gabizon, Avi Wigderson. Extractors And Rank Extractors For Polynomial Sources
    59 -- 79Ali Juma, Valentine Kabanets, Charles Rackoff, Amir Shpilka. The Black-Box Query Complexity of Polynomial Summation
    81 -- 103Peter Bürgisser. On Defining Integers And Proving Arithmetic Circuit Lower Bounds
    105 -- 154Ezequiel Dratman, Guillermo Matera, Ariel Waissbein. Robust Algorithms For Generalized Pham Systems
    155 -- 168Amir Hashemi. Nullstellensätze for Zero-Dimensional Gröbner Bases
    runs on