Special Issue On Worst-case Versus Average-case Complexity Editors’ Foreword Oded GoldreichSalil Vadhan OriginalPaper Open access 05 December 2007 Pages: 325 - 330
Pseudorandomness and Average-Case Complexity Via Uniform Reductions Luca TrevisanSalil Vadhan OriginalPaper Open access 05 December 2007 Pages: 331 - 364
Generalized Compact Knapsacks, Cyclic Lattices, and Efficient One-Way Functions Daniele Micciancio OriginalPaper Open access 05 December 2007 Pages: 365 - 411
If NP Languages are Hard on the Worst-Case, Then it is Easy to Find Their Hard Instances Dan GutfreundRonen ShaltielAmnon Ta-Shma OriginalPaper Open access 05 December 2007 Pages: 412 - 441