EDITORS' FOREWORD
Reductions in Circuit Complexity: An Isomorphism Theorem and a Gap Theorem
Integer Programming as a Framework for Optimization and Approximability
Good Degree Bounds on Nullstellensatz Refutations of the Induction Principle
DNA Models and Algorithms for NP-Complete Problems
Zero Knowledge and the Chromatic Number
NondeterministicNC1Computation
Deterministic and Randomized Bounded Truth-Table Reductions of P, NL, and L to Sparse Sets