The Complexity Theory Companion (Texts in Theoretical Computer Science. An EATCS Series)
| Author | : | |
| Rating | : | 4.21 (827 Votes) |
| Asin | : | 3642086845 |
| Format Type | : | paperback |
| Number of Pages | : | 372 Pages |
| Publish Date | : | 2015-10-27 |
| Language | : | English |
DESCRIPTION:
The book is organized by technique rather than by topic. Here is an accessible, algorithmically oriented guide to some of the most interesting techniques of complexity theory. Each chapter focuses on one technique: what it is, and what results and applications it yields.. The book shows that simple algorithms are at the heart of complexity theory
In contrast to the organization of other books, each chapter of this book focuses on one particular technique in complexity theory. Weaver, Journal of the Operational Research Society, Vol. The book presents a survey on a great variety of recent interesting techniques in complexity." (Ludwig Staiger, Zentralblatt MATH, Vol. … The book contains two appendices, the first presenting a concise overview on complexity classes, the second one on reductions. … The appendices are very well laid out and could probably replace a small library of textbooks." (A. 54, 2004)"The book is intended for readers who seek an accessible, algorithmically oriented research-centered, up-to-date guide to
Good idea, but badly executed The aim of this book is to introduce complexity theory using a more technique-oriented approach, which is not seen in other complexity theory textbooks. Techniques covered are:- self-reducibility- one-way function- tournament divide and conquer- isolation technique (aka. isolation lemma)- witness reduction- polynomial interpolation- nonsolvable group (used in Barrington's theorem to show that width-five branc