1. On the hardness of computing the permanent of random matrices

   • Uriel Feige
   • Carsten Lund

   OriginalPaper Pages: 101 - 132

2. An average complexity measure that yields tight hierarchies

   • R. Reischuk
   • C. Schindelhauer

   OriginalPaper Pages: 133 - 173

3. Simple learning algorithms using divide and conquer

   • Nader H. Bshouty

   OriginalPaper Pages: 174 - 194