Here is an accessible, algorithmically oriented guide to some of the most interesting techniques of complexity theory. The book shows that simple algorithms are at the heart of complexity theory. The book is organized by technique rather than by topic. Each chapter focuses on one technique: what it is, and what results and applications it yields.
Or split into 4x interest-free payments of 25% on orders over R50
Learn more
Here is an accessible, algorithmically oriented guide to some of the most interesting techniques of complexity theory. The book shows that simple algorithms are at the heart of complexity theory. The book is organized by technique rather than by topic. Each chapter focuses on one technique: what it is, and what results and applications it yields.
Imprint | Springer-Verlag |
Country of origin | Germany |
Series | Texts in Theoretical Computer Science. An EATCS Series |
Release date | December 2010 |
Availability | Expected to ship within 10 - 15 working days |
First published | 2002 |
Authors | Lane A. Hemaspaandra, Mitsunori Ogihara |
Dimensions | 235 x 155 x 20mm (L x W x T) |
Format | Paperback |
Pages | 372 |
Edition | Softcover reprint of hardcover 1st ed. 2002 |
ISBN-13 | 978-3-642-08684-7 |
Barcode | 9783642086847 |
Categories | |
LSN | 3-642-08684-5 |