1. Exponential lower bounds for the pigeonhole principle

   • Toniann Pitassi
   • Paul Beame
   • Russell Impagliazzo

   OriginalPaper Pages: 97 - 140

2. Bounds on tradeoffs between randomness and communication complexity

   • Ran Canetti
   • Oded Goldreich

   OriginalPaper Pages: 141 - 167

3. Improving known solutions is hard

   • Desh Ranjan
   • Suresh Chari
   • Pankaj Rohatgi

   OriginalPaper Pages: 168 - 185

4. Relativized isomorphisms of NP-complete sets

   • Judy Goldsmith
   • Deborah Joseph

   OriginalPaper Pages: 186 - 205