Publisher's Synopsis
Twenty-six presentations made in 15 sessions at the May 1996 conference providing original research and theories in a variety of areas in computational complexity. The papers cover topics in circuit complexity, collapsing oracle-tape hierarchies, randomness extraction, error reduction by parallel repetition, randomization and derandomization in spa