GUEST EDITOR'S FOREWORD
The Communication Complexity of Enumeration, Elimination, and Selection
On the Complexity of Some Problems on Groups Input as Multiplication Tables
Quantum Kolmogorov Complexity
Branching Program Size Is Almost Linear in Formula Size
Easiness Assumptions and Hardness Tests: Trading Time for Zero Error
A Lower Bound for the Shortest Path Problem
Time–Space Tradeoffs for SAT on Nonuniform Machines
Integer Circuit Evaluation Is PSPACE-Complete
Papers to Appear in Forthcoming Issues