The Complexity Theory Companion by Lane A. Hemaspaandra, Mitsunori Ogihara.

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-...

Full description

Saved in:
Bibliographic Details
Main Authors: Hemaspaandra, Lane A. (Author), Ogihara, Mitsunori (Author)
Corporate Author: SpringerLink (Online service)
Format: eBook
Language:English
Published: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2002.
Edition:1st ed. 2002.
Series:Texts in Theoretical Computer Science. An EATCS Series,
Springer eBook Collection.
Subjects:
Online Access:Click to view e-book
Holy Cross Note:Loaded electronically.
Electronic access restricted to members of the Holy Cross Community.

MARC

LEADER 00000nam a22000005i 4500
001 b3247783
003 MWH
005 20191024212645.0
007 cr nn 008mamaa
008 130305s2002 gw | s |||| 0|eng d
020 |a 9783662048801 
024 7 |a 10.1007/978-3-662-04880-1  |2 doi 
035 |a (DE-He213)978-3-662-04880-1 
050 4 |a E-Book 
072 7 |a UM  |2 bicssc 
072 7 |a COM051000  |2 bisacsh 
072 7 |a UM  |2 thema 
100 1 |a Hemaspaandra, Lane A.  |e author.  |4 aut  |4 http://id.loc.gov/vocabulary/relators/aut 
245 1 4 |a The Complexity Theory Companion  |h [electronic resource] /  |c by Lane A. Hemaspaandra, Mitsunori Ogihara. 
250 |a 1st ed. 2002. 
264 1 |a Berlin, Heidelberg :  |b Springer Berlin Heidelberg :  |b Imprint: Springer,  |c 2002. 
300 |a XIII, 372 p.  |b online resource. 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
347 |a text file  |b PDF  |2 rda 
490 1 |a Texts in Theoretical Computer Science. An EATCS Series,  |x 1862-4499 
490 1 |a Springer eBook Collection 
505 0 |a 1. The Self-Reducibility Technique -- 2. The One-Way Function Technique -- 3. The Tournament Divide and Conquer Technique -- 4. The Isolation Technique -- 5. The Witness Reduction Technique -- 6. The Polynomial Interpolation Technique -- 7. The Nonsolvable Group Technique -- 8. The Random Restriction Technique -- 9. The Polynomial Technique -- A. A Rogues’ Gallery of Complexity Classes -- B. A Rogues’ Gallery of Reductions -- References. 
520 |a 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. 
590 |a Loaded electronically. 
590 |a Electronic access restricted to members of the Holy Cross Community. 
650 0 |a Computer programming. 
650 0 |a Algorithms. 
650 0 |a Combinatorics. 
650 0 |a Data structures (Computer science). 
650 0 |a Computer science—Mathematics. 
690 |a Electronic resources (E-books) 
700 1 |a Ogihara, Mitsunori.  |e author.  |4 aut  |4 http://id.loc.gov/vocabulary/relators/aut 
710 2 |a SpringerLink (Online service) 
773 0 |t Springer eBooks 
830 0 |a Texts in Theoretical Computer Science. An EATCS Series,  |x 1862-4499 
830 0 |a Springer eBook Collection. 
856 4 0 |u https://holycross.idm.oclc.org/login?auth=cas&url=https://doi.org/10.1007/978-3-662-04880-1  |3 Click to view e-book 
907 |a .b32477831  |b 04-18-22  |c 02-26-20 
998 |a he  |b 02-26-20  |c m  |d @   |e -  |f eng  |g gw   |h 4  |i 1 
912 |a ZDB-2-SCS 
912 |a ZDB-2-BAE 
950 |a Computer Science (Springer-11645) 
902 |a springer purchased ebooks 
903 |a SEB-COLL 
945 |f  - -   |g 1  |h 0  |j  - -   |k  - -   |l he   |o -  |p $0.00  |q -  |r -  |s b   |t 38  |u 0  |v 0  |w 0  |x 0  |y .i21609482  |z 02-26-20 
999 f f |i 46bcf294-6971-5401-8b49-c7caacf1bfe2  |s 4a01c793-13aa-5d65-8097-dafe9e7ad7ab 
952 f f |p Online  |a College of the Holy Cross  |b Main Campus  |c E-Resources  |d Online  |e E-Book  |h Library of Congress classification  |i Elec File  |n 1