1. The complexity of semilinear problems in succinct representation

   • Peter Bürgisser
   • Felipe Cucker
   • Paulin Jacobé de Naurois

   OriginalPaper Pages: 197 - 235

2. Efficient algorithm for computing the Euler–Poincaré characteristic of a semi-algebraic set defined by few quadratic inequalities

   • Saugata Basu

   OriginalPaper Pages: 236 - 251

3. Polynomial multiplication over finite fields: from quadratic to straight-line complexity

   • Nader H. Bshouty
   • Michael Kaminski

   OriginalPaper Pages: 252 - 262

4. Lower bounds for linear locally decodable codes and private information retrieval

   • Oded Goldreich
   • Howard Karloff
   • Luca Trevisan

   OriginalPaper Pages: 263 - 296