+612 9045 4394
 
CHECKOUT
The Complexity Theory Companion : Texts in Theoretical Computer Science - Lane A. Hemaspaandra

The Complexity Theory Companion

Texts in Theoretical Computer Science

Hardcover

Published: 1st December 2001
Ships: 7 to 10 business days
7 to 10 business days
RRP $258.99
$178.95
31%
OFF
or 4 easy payments of $44.74 with Learn more
if ordered within

Other Available Formats (Hide)

  • Paperback View Product Published: 15th December 2010
    $135.51

Here is an accessible, algorithmically oriented guide to some of the most interesting techniques of complexity theory. The book shows that simple algorithms are at the heart of complexity theory. The book is organized by technique rather than by topic. Each chapter focuses on one technique: what it is, and what results and applications it yields.

From the reviews of the first edition:





"The introduction ... begins with two secrets: that algorithms are at the heart of complexity theory, and moreover that simple algorithms are at the heart of complexity theory. The main body of the book then proceeds to try and illustrate this view. ... While all the chapters primarily deal with a succession of theorems, lemmas and proofs, the surrounding text makes it fairly accessible and readable. ... The appendices are very well laid out and could probably replace a small library of textbooks." (A. Weaver, Journal of the Operational Research Society, Vol. 54, 2004)

"The book is intended for readers who seek an accessible, algorithmically oriented research-centered, up-to-date guide to several interesting techniques of computational complexity. In contrast to the organization of other books, each chapter of this book focuses on one particular technique in complexity theory. ... The book contains two appendices, the first presenting a concise overview on complexity classes, the second one on reductions. The book presents a survey on a great variety of recent interesting techniques in complexity." (Ludwig Staiger, Zentralblatt MATH, Vol. 993, 2002)

Preface
The Self-Reducibility Technique
The One-Way Function Technique
The Tournament Divide and Conquer Technique
The Isolation Technique
The Witness Reduction Technique
The Polynomial Interpolation Technique
The Nonsolvable Group Technique
The Random Restriction Technique
The Polynomial Technique
A Rogues' Gallery of Complexity Classes
A Rogues' Gallery of Reductions
References
Index
Table of Contents provided by Publisher. All Rights Reserved.

ISBN: 9783540674191
ISBN-10: 3540674195
Series: Texts in Theoretical Computer Science
Audience: Professional
Format: Hardcover
Language: English
Number Of Pages: 372
Published: 1st December 2001
Publisher: Springer-Verlag Berlin and Heidelberg Gmbh & Co. Kg
Country of Publication: DE
Dimensions (cm): 24.77 x 16.51  x 3.18
Weight (kg): 0.7