The Complexity Theory Companion [electronic resource] /

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.

Bibliographic Details

Main Authors:	Hemaspaandra, Lane A. author., Ogihara, Mitsunori. author., SpringerLink (Online service)
Format:	Texto biblioteca
Language:	eng
Published:	Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2002
Subjects:	Computer science., Computer programming., Data structures (Computer science)., Algorithms., Computer science, Combinatorics., Computer Science., Programming Techniques., Algorithm Analysis and Problem Complexity., Data Structures, Cryptology and Information Theory., Math Applications in Computer Science., Discrete Mathematics in Computer Science.,
Online Access:	http://dx.doi.org/10.1007/978-3-662-04880-1
Tags:	Add Tag No Tags, Be the first to tag this record!