This book deals mostly with impossibility results - lower bounds on what can be accomplished by algorithms. However, the perspective is unapologetically that of

In this treatment of algorithmic complexity the authors explore an area fundamental to the study of the foundations of computer science. It is a topic which is

Thomas M. Cover and B. Gopinatb The papers in this volume are the contributions to a special workshop on problems in communication and computation conducted in

Communication complexity is the mathematical study of scenarios where several parties need to communicate to achieve a common goal, a situation that naturally a