1. Exponential lower bounds for depth three Boolean circuits

   • R. Paturi
   • M. E. Saks
   • F. Zane

   Pages: 1 - 15

2. A complex-number Fourier technique for lower bounds on the Mod-m degree

   • F. Green

   Pages: 16 - 38

3. The average sensitivity of square-freeness

   • A. Bernasconi
   • C. Damm
   • I. Shparlinski

   Pages: 39 - 51

4. The complexity of counting colourings and independent sets in sparse graphs and hypergraphs

   • C. Greenhill

   Pages: 52 - 72