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
    runs on