Computational Complexity, Volume 13

Volume 13, Numbers 1-2, December 2004

• Valentine Kabanets, Russell Impagliazzo:
  Derandomizing Polynomial Identity Tests Means Proving Circuit Lower Bounds. 1-46
  Electronic Edition (link) BibTeX
• Maria Luisa Bonet, Carlos Domingo, Ricard Gavaldà, Alexis Maciel, Toniann Pitassi:
  Non-Automatizability of Bounded-Depth Frege Proofs. 47-68
  Electronic Edition (link) BibTeX
• Satoru Kuroda:
  Recursion Schemata for Slowly Growing Depth Circuit Classes. 69-89
  Electronic Edition (link) BibTeX

Volume 13, Number 3-4, February 2005

• Erich Kaltofen, Gilles Villard:
  On the complexity of computing determinants. 91-130
  Electronic Edition (link) BibTeX
• Pascal Koiran:
  Valiant's model and the cost of computing integers. 131-146
  Electronic Edition (link) BibTeX
• Emanuele Viola:
  The complexity of constructing pseudorandom generators from hard functions. 147-188
  Electronic Edition (link) BibTeX