| 297 | -- | 0 | Harry Buhrman. Foreword |
| 298 | -- | 312 | Ryan O Donnell, Rocco A. Servedio. Extremal properties of polynomial threshold functions |
| 313 | -- | 322 | Scott Aaronson. Quantum certificate complexity |
| 323 | -- | 334 | Albert Atserias, Víctor Dalmau. A combinatorial characterization of resolution width |
| 335 | -- | 349 | Subhash Khot, Oded Regev. Vertex cover might be hard to approximate to within 2-epsilon |
| 350 | -- | 357 | Wolfgang Merkle. The complexity of stochastic sequences |
| 358 | -- | 363 | Lance Fortnow, Aduri Pavan, Samik Sengupta. Proving SAT does not have small circuits with an application to the two queries problem |
| 364 | -- | 385 | Pranab Sen, Srinivasan Venkatesh. Lower bounds for predecessor searching in the cell probe model |
| 386 | -- | 393 | Chris Calabro, Russell Impagliazzo, Valentine Kabanets, Ramamohan Paturi. The complexity of Unique k-SAT: An Isolation Lemma for k-CNFs |
| 394 | -- | 403 | Detlef Sieling. Minimization of decision trees is hard to approximate |
| 404 | -- | 405 | Susan B. Davidson, Wenfei Fan, Carmem S. Hara. Erratum to Propagating XML constraints to relations [JCSS 73 (2007) 316-361] |