The Complexity Theory Companion

Lane A. Hemaspaandra, Mitsunori Ogihara

368 pages, parution le 01/11/2001

Ajouter à une liste

Indisponible

Résumé

The Complexity Theory Companion is an accessible, algorithmically oriented, research-centered, up-to-date guide to some of the most interesting techniques of complexity theory.
The book's thesis is that simple algorithms are at the heart of complexity theory. From the tree-pruning and interval-pruning algorithms that shape the first chapter to the query simulation procedures that dominate the last chapter, the central proof methods of the book are algorithmic. And to more clearly highlight the role of algorithmic techniques in complexity theory, the book is - unlike other texts on complexity - organized by technique rather than by topic. Each chapter of this book focuses on one technique: what it is, and what results and applications it yields.
This textbook was developed at the University of Rochester in courses given to graduate students and advanced undergraduates. Researchers also will find this book a valuable source of reference due to the comprehensive bibliography of close to five hundred entries, the thirty-five page subject index, and the appendices giving overviews of complexity classes and reductions.

Contents

Preface
The Self-Reducibility Technique
The One-Way Function Technique
The Tournament Divide and Conquer Technique
The Isolation Technique
The Witness Reduction Technique
The Polynomila Interpolation Technique
The Nonsolvable Group Technique
The Random Restriction Technique
The Polynomial Technique
A Rogue's Gallery of Complexity Classes
A Rogue's Gallery of Reduction
References
Index

Caractéristiques techniques

	PAPIER
Éditeur(s)	Springer
Auteur(s)	Lane A. Hemaspaandra, Mitsunori Ogihara
Parution	01/11/2001
Nb. de pages	368
Format	16 x 24
Couverture	Relié
Poids	700g
Intérieur	Noir et Blanc
EAN13	9783540674191