Editor′s Foreword
On Unique Satisfiability and the Threshold Behavior of Randomized Reductions
Superlinear Lower Bounds for Bounded-Width Branching Programs
Complexity Classes and Sparse Oracles
Approximation Properties of NP Minimization Classes
Closure Properties and Witness Reduction
Monotone Separation of Logarithmic Space from Logarithmic Depth
Editor′s Foreword
Circuits, Matrices, and Nonassociative Computation
The Power of the Middle Bit of a #P Function
Bounding the Complexity of Advice Functions
Saving Queries with Randomness
Descriptive Complexity of #P Functions
Interactive Proof Systems with Polynomially Bounded Strategies
Editor′s Foreword
Learning Boolean Read-Once Formulas over Generalized Bases
An O(nlog log n) Learning Algorithm for DNF under the Uniform Distribution
On Weak Learning
Breaking the Probability 12 Barrier in FIN-Type Learning
Cryptographic Lower Bounds for Learnability of Boolean Functions on the Uniform Distribution
Author Index for Volume 50