1. Preface to the Special Issue from Random’06

   • Oded Goldreich

   OriginalPaper 24 March 2008 Pages: 1 - 2

2. Randomness-Efficient Sampling within NC¹

   • Alexander D. Healy

   OriginalPaper 24 March 2008 Pages: 3 - 37

3. On Pseudorandom Generators with Linear Stretch in NC⁰

   • Benny Applebaum
   • Yuval Ishai
   • Eyal Kushilevitz

   OriginalPaper 24 March 2008 Pages: 38 - 69

4. Space Complexity Vs. Query Complexity

   • Oded Lachish
   • Ilan Newman
   • Asaf Shapira

   OriginalPaper 02 April 2008 Pages: 70 - 93

5. Inverse NP Problems

   • Hubie Chen

   OriginalPaper 02 April 2008 Pages: 94 - 118

6. Hardness Hypotheses, Derandomization, and Circuit Complexity

   • John M. Hitchcock
   • A. Pavan

   OriginalPaper 02 April 2008 Pages: 119 - 146