Special Issue “Conference on Computational Complexity 2005” Guest Editor’s Foreword Anna Gál OriginalPaper Open access Pages: 297 - 297
Pseudorandomness for Approximate Counting and Sampling Ronen ShaltielChristopher Umans OriginalPaper Open access Pages: 298 - 341
Complexity of Ring Morphism Problems Neeraj KayalNitin Saxena OriginalPaper Open access Pages: 342 - 390
A Strong Direct Product Theorem for Corruption and the Multiparty Communication Complexity of Disjointness Paul BeameToniann PitassiAvi Wigderson OriginalPaper Open access Pages: 391 - 432
Inductive Time-Space Lower Bounds for Sat and Related Problems Ryan Williams OriginalPaper Open access Pages: 433 - 470