Computational Complexity, Volume 11

Volume 11, Numbers 1-2, June 2002

• Oded Goldreich, Salil P. Vadhan, Avi Wigderson:
  On interactive proofs with a laconic prover. 1-53
  
• Carsten Damm, Markus Holzer, Pierre McKenzie:
  The complexity of tensor calculus. 54-89
  

Volume 11, Numbers 3-4, June 2002

• Josh Buresh-Oppenheim, Matthew Clegg, Russell Impagliazzo, Toniann Pitassi:
  Homogenization and the polynomial calculus. 91-108
  
• Eli Ben-Sasson:
  Hard examples for the bounded depth Frege proof system. 109-136
  
• Lance Fortnow, John D. Rogers:
  Separability and one-way functions. 137-157
  
• Bruno Codenotti, Igor Shparlinski, Arne Winterhof:
  On the hardness of approximating the permanent of structured matrices. 158-170