External Links

    Journal: Computational Complexity

    Volume 17, Issue 4

    459 -- 474Xiaoyang Gu, Jack H. Lutz. Dimension Characterizations of Complexity Classes
    475 -- 500Venkatesan Guruswami, Valentine Kabanets. Hardness Amplification via Space-Efficient Direct Products
    501 -- 514Aduri Pavan, N. V. Vinodchandran. 2-Local Random Reductions to 3-Valued Functions
    515 -- 535Ran Raz, Amir Yehudayoff. Balancing Syntactically Multilinear Arithmetic Circuits
    536 -- 548Dima Grigoriev. Probabilistic Communication Complexity Over The Reals
    549 -- 566Johan Håstad. Every 2-csp Allows Nontrivial Approximation

    Volume 17, Issue 3

    353 -- 376Lance Fortnow, Russell Impagliazzo, Valentine Kabanets, Christopher Umans. On the Complexity of Succinct Zero-Sum Games
    377 -- 406Saugata Basu, Nayantara Bhatnagar, Parikshit Gopalan, Richard J. Lipton. Polynomials that Sign Represent Parity and Descartes Rule of Signs
    407 -- 457Ran Raz, Iddo Tzameret. The Strength of Multilinear Proofs

    Volume 17, Issue 2

    147 -- 148Peter Bro Miltersen. Special Issue: Conference on Computational Complexity 2007 Guest Editor s Foreword
    149 -- 178Alexander A. Sherstov. Halfspace Matrices
    179 -- 219R. Ryan Williams. Time-Space Tradeoffs for Counting NP Solutions Modulo Integers
    220 -- 253Marius Zimand. Exposure-Resilient Extractors and the Derandomization of Probabilistic Sublinear Time
    254 -- 281Jin-yi Cai, Pinyan Lu. Basis Collapse in Holographic Algorithms
    282 -- 299Richard Cleve, William Slofstra, Falk Unger, Sarvagya Upadhyay. Perfect Parallel Repetition Theorem for Quantum Xor Proof Systems
    300 -- 351Chris Peikert. Limits on the Hardness of Lattice Problems in ::::l::::::::::p:::::: Norms

    Volume 17, Issue 1

    1 -- 2Oded Goldreich. Preface to the Special Issue from Random 06
    3 -- 37Alexander Healy. Randomness-Efficient Sampling within NC:::1:::
    38 -- 69Benny Applebaum, Yuval Ishai, Eyal Kushilevitz. On Pseudorandom Generators with Linear Stretch in NC:::0:::
    70 -- 93Oded Lachish, Ilan Newman, Asaf Shapira. Space Complexity Vs. Query Complexity
    94 -- 118Hubie Chen. Inverse NP Problems
    119 -- 146John M. Hitchcock, Aduri Pavan. Hardness Hypotheses, Derandomization, and Circuit Complexity
    runs on