This book is an introductory textbook on the design and analysis of algorithms. The author uses a careful selection of a few topics to illustrate the tools for

This book constitutes the refereed conference proceedings of the 12th International Conference on Algorithms and Complexity, CIAC 2019, held as a virtual event,

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

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

Reflects recent developments in its emphasis on randomized and approximation algorithms and communication models All topics are considered from an algorithmic p