Editorial Board
Foreword
Extremal properties of polynomial threshold functions
Quantum certificate complexity
A combinatorial characterization of resolution width
Vertex cover might be hard to approximate to within 2−ε
The complexity of stochastic sequences
Proving SAT does not have small circuits with an application to the two queries problem
Lower bounds for predecessor searching in the cell probe model
The complexity of Unique k-SAT: An Isolation Lemma for k-CNFs
Minimization of decision trees is hard to approximate
Erratum to “Propagating XML constraints to relations” [J. Comput. System Sci. 73 (2007) 316–361]
Contents