External Links

    Journal: Computational Complexity

    Volume 15, Issue 4

    297 -- 0Anna Gál. Special Issue Conference on Computational Complexity 2005 Guest Editor s Foreword
    298 -- 341Ronen Shaltiel, Christopher Umans. Pseudorandomness for Approximate Counting and Sampling
    342 -- 390Neeraj Kayal, Nitin Saxena. Complexity of Ring Morphism Problems
    391 -- 432Paul Beame, Toniann Pitassi, Nathan Segerlind, Avi Wigderson. A Strong Direct Product Theorem for Corruption and the Multiparty Communication Complexity of Disjointness
    433 -- 470Ryan Williams. Inductive Time-Space Lower Bounds for Sat and Related Problems

    Volume 15, Issue 3

    197 -- 235Peter Bürgisser, Felipe Cucker, Paulin Jacobé de Naurois. The complexity of semilinear problems in succinct representation
    236 -- 251Saugata Basu. Efficient algorithm for computing the Euler-Poincaré characteristic of a semi-algebraic set defined by few quadratic inequalities
    252 -- 262Nader H. Bshouty, Michael Kaminski. Polynomial multiplication over finite fields: from quadratic to straight-line complexity
    263 -- 296Oded Goldreich, Howard J. Karloff, Leonard J. Schulman, Luca Trevisan. Lower bounds for linear locally decodable codes and private information retrieval

    Volume 15, Issue 2

    93 -- 0Anna Gál. Special Issue Conference on Computational Complexity 2005 Guest Editor s Foreword
    94 -- 114Shuchi Chawla, Robert Krauthgamer, Ravi Kumar, Yuval Rabani, D. Sivakumar. On the Hardness of Approximating Multicut and Sparsest-Cut
    115 -- 162Benny Applebaum, Yuval Ishai, Eyal Kushilevitz. Computationally Private Randomizing Polynomials and Their Applications
    163 -- 196Sophie Laplante, Troy Lee, Mario Szegedy. The Quantum Adversary Method and Classical Formula Size Lower Bounds

    Volume 15, Issue 1

    1 -- 19Kiran S. Kedlaya. Quantum computation of zeta functions of curves
    20 -- 39Elad Hazan, Shmuel Safra, Oded Schwartz. On the complexity of approximating ::::k::::-set packing
    40 -- 61Jan Kára, Daniel Král. Free binary decision diagrams for the computation of EAR::::::n::::::
    62 -- 81Kristoffer Arnsfelt Hansen, Peter Bro Miltersen, V. Vinay. Circuits on cylinders
    82 -- 91Richard Beigel, Lance Fortnow, William I. Gasarch. A tight lower bound for restricted pir protocols
    runs on