The Complexity Theory Companion (Texts in Theoretical Computer Science. An EATCS Series) - Hardcover

Buch 7 von 44: Texts in Theoretical Computer Science. An EATCS

Hemaspaandra, Lane A.; Ogihara, Mitsunori

 
9783540674191: The Complexity Theory Companion (Texts in Theoretical Computer Science. An EATCS Series)
Hardcover
ISBN 10: 3540674195 ISBN 13: 9783540674191
Verlag: Springer, 2001

Inhaltsangabe

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.

Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.

Von der hinteren Coverseite

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.

„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.

Verlag
Springer
Erscheinungsdatum
2001
Sprache
Englisch
ISBN 10 
3540674195
ISBN 13 
9783540674191
Einband
Gebundene Ausgabe
Anzahl der Seiten
385
Kontakt zum Hersteller
ProductSafety@springernature.com
ProductSafety@springernature.com

Poststr. 9
Darmstadt
64293
Deutschland

Weitere beliebte Ausgaben desselben Titels

9783642086847: The Complexity Theory Companion: With 43 Figures (Texts in Theoretical Computer Science. An EATCS Series)

Vorgestellte Ausgabe

ISBN 10:  3642086845 ISBN 13:  9783642086847
Verlag: Springer, 2010
Softcover