GUEST EDITORS' FOREWORD
Isolation, Matching, and Counting Uniform and Nonuniform Upper Bounds
Two Queries
On Arithmetic Branching Programs
Approximating the SVP to within a Factor (1+1/dimε) Is NP-Hard under Randomized Reductions
Complexity Limitations on Quantum Computation
Computational Indistinguishability: A Sample Hierarchy
On Membership Comparable Sets
Space-Bounded Quantum Complexity
Hard Sets Are Hard to Find
Arthur–Merlin Games in Boolean Decision Trees