1. SPECIAL ISSUE “CONFERENCE ON COMPUTATIONAL COMPLEXITY 2005” GUEST EDITOR’S FOREWORD

   • Anna Gál

   Original Paper Open access Pages: 93 - 93

2. ON THE HARDNESS OF APPROXIMATING MULTICUT AND SPARSEST-CUT

   • Shuchi Chawla
   • Robert Krauthgamer
   • D. Sivakumar

   Original Paper Open access Pages: 94 - 114

3. COMPUTATIONALLY PRIVATE RANDOMIZING POLYNOMIALS AND THEIR APPLICATIONS

   • Benny Applebaum
   • Yuval Ishai
   • Eyal Kushilevitz

   Original Paper Open access Pages: 115 - 162

4. THE QUANTUM ADVERSARY METHOD AND CLASSICAL FORMULA SIZE LOWER BOUNDS

   • Sophie Laplante
   • Troy Lee
   • Mario Szegedy

   Original Paper Open access Pages: 163 - 196