SPECIAL ISSUE “CONFERENCE ON COMPUTATIONAL COMPLEXITY 2005” GUEST EDITOR’S FOREWORD Anna Gál Original Paper Open access Pages: 93 - 93
ON THE HARDNESS OF APPROXIMATING MULTICUT AND SPARSEST-CUT Shuchi ChawlaRobert KrauthgamerD. Sivakumar Original Paper Open access Pages: 94 - 114
COMPUTATIONALLY PRIVATE RANDOMIZING POLYNOMIALS AND THEIR APPLICATIONS Benny ApplebaumYuval IshaiEyal Kushilevitz Original Paper Open access Pages: 115 - 162
THE QUANTUM ADVERSARY METHOD AND CLASSICAL FORMULA SIZE LOWER BOUNDS Sophie LaplanteTroy LeeMario Szegedy Original Paper Open access Pages: 163 - 196