The Complexity Theory Companion 2002nd Edition by Lane A Hemaspaandra, Mitsunori Ogihara ISBN 3540674195 9783540674191 by Lane A. Hemaspaandra, Mitsunori Ogihara 9783540674191, 3540674195 instant download after payment.

The Complexity Theory Companion 2002nd Edition by Lane A Hemaspaandra, Mitsunori Ogihara - Ebook PDF Instant Download/Delivery: 3540674195, 9783540674191
Full download The Complexity Theory Companion 2002nd Edition after payment

Product details:

ISBN 10: 3540674195 
ISBN 13: 9783540674191
Author: 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-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.

The Complexity Theory Companion 2002nd Table of contents:

• 1. The Self-Reducibility Technique

  • (This chapter covers whether NP is likely to have sparse complete sets, and whether any sparse sets at all are likely to be in NP-P. Coverage includes the Left Set Technique, the Hartmanis-Immerman-Sewelson Encoding, Mahaney's Theorem, and the Ogiwara-Watanabe Theorem.)

• 2. The One-Way Function Technique

• 3. The Tournament Divide and Conquer Technique

• 4. The Isolation Technique

  • (This chapter's coverage includes the Isolation Lemma, the Valiant-Vazirani Theorem, Toda's Theorem, and the Wigderson/Gal/Allender/Reinhardt work that led to NL/poly=UL/poly.)

• 5. The Witness Reduction Technique

• 6. The Polynomial Interpolation Technique

• 7. The Nonsolvable Group Technique

• 8. The Random Restriction Technique

• 9. The Polynomial Technique

People also search for The Complexity Theory Companion 2002nd:

the complexity theory companion
    
the complexity theory companion pdf
    
what is complexity theory
    
complexity theory explained
    
what is complexity theory in management

Tags: Lane A Hemaspaandra, Mitsunori Ogihara, Complexity, Companion