Editorial Board
Foreword
The isomorphism conjecture for constant depth reductions
The pervasive reach of resource-bounded Kolmogorov complexity in computational complexity theory
Holographic algorithms: From art to science
Hardness results for approximating the bandwidth
Infeasibility of instance compression and succinct PCPs for NP
Hardness amplification within NP against deterministic algorithms
Heuristic algorithms in computational molecular biology
On the hardness of learning intersections of two halfspaces
The complexity of Boolean formula minimization
A bridging model for multi-core computing
Multilinear formulas, maximal-partition discrepancy and mixed-sources extractors
Deterministic extractors for small-space sources
Contents