The subject of these notes is counting and related topics, viewed from a computational perspective. A major theme of the book is the idea of accumulating inform

Computational Complexity of Counting and Samplingprovides readers with comprehensive and detailed coverage of the subject of computational complexity. It is pri

New and classical results in computational complexity, including interactive proofs, PCP, derandomization, and quantum computation. Ideal for graduate students.

Here are the refereed proceedings of the Second International Workshop on Parameterized and Exact Computation, IWPEC 2006, held in the context of the combined c

This book constitutes the refereed proceedings of the 6th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2002,