0
Your cart

Your cart is empty

Books > Science & Mathematics > Mathematics > Combinatorics & graph theory

Buy Now

The Complexity Theory Companion (Hardcover, 2002 ed.) Loot Price: R2,605
Discovery Miles 26 050
The Complexity Theory Companion (Hardcover, 2002 ed.): Lane A. Hemaspaandra, Mitsunori Ogihara

The Complexity Theory Companion (Hardcover, 2002 ed.)

Lane A. Hemaspaandra, Mitsunori Ogihara

Series: Texts in Theoretical Computer Science. An EATCS Series

 (sign in to rate)
Loot Price R2,605 Discovery Miles 26 050 | Repayment Terms: R244 pm x 12*

Bookmark and Share

Expected to ship within 12 - 19 working days

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.

General

Imprint: Springer-Verlag
Country of origin: Germany
Series: Texts in Theoretical Computer Science. An EATCS Series
Release date: December 2001
First published: 2002
Authors: Lane A. Hemaspaandra • Mitsunori Ogihara
Dimensions: 235 x 155 x 22mm (L x W x T)
Format: Hardcover
Pages: 372
Edition: 2002 ed.
ISBN-13: 978-3-540-67419-1
Categories: Books > Science & Mathematics > Mathematics > Probability & statistics
Books > Science & Mathematics > Mathematics > Combinatorics & graph theory
Books > Computing & IT > General theory of computing > Mathematical theory of computation
Books > Computing & IT > General theory of computing > Data structures
Books > Computing & IT > Computer programming > Algorithms & procedures
Promotions
LSN: 3-540-67419-5
Barcode: 9783540674191

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!

You might also like..

Applied Combinatorics
Alan Tucker Hardcover R5,431 Discovery Miles 54 310
Handbook of Research on Advanced…
Madhumangal Pal, Sovan Samanta, … Hardcover R7,278 Discovery Miles 72 780
Fixed Point Theory and Graph Theory…
Monther Alfuraidan, Qamrul Ansari Hardcover R1,973 Discovery Miles 19 730
Mesh - Eine Reise Durch Die Diskrete…
Beau Janzen, Konrad Polthier Book R200 Discovery Miles 2 000
Bent Functions - Results and…
Natalia Tokareva Paperback R1,547 Discovery Miles 15 470
Probability - Risk Management…
Daniel Covington Hardcover R994 Discovery Miles 9 940
Introduction to Graph Theory
Robin J. Wilson Paperback R1,369 Discovery Miles 13 690
Spectral Radius of Graphs
Dragan Stevanovic Paperback R1,014 Discovery Miles 10 140
Social Simulation for a Crisis - Results…
Frank Dignum Hardcover R4,951 Discovery Miles 49 510
Essential Topics in Combinatorics
Lucas Lincoln Hardcover R3,140 Discovery Miles 31 400
Counting: Solutions Manual (2nd Edition)
Khee Meng Koh, Eng Guan Tay Paperback R1,164 Discovery Miles 11 640
Counting (2nd Edition)
Khee Meng Koh, Eng Guan Tay Paperback R803 Discovery Miles 8 030

See more

Partners