Computational Complexity (CoCo 2000) : 15th Annual IEEE

This volume includes 30 papers presented at the July 2000 conference. All areas of computational complexity are examined, including time-space tradeoffs and lower bounds, phase transitions, the SAT problem, PSPACE-completion, determinism, and Kolmogorov complexity. Name index only. Annotation c. Boo