Complexity Theory - Exploring the Limits of Efficient Algorithms (Paperback, Softcover reprint of hardcover 1st ed. 2005)
Ingo WegenerReflects recent developments in its emphasis on randomized and approximation algorithms and communication models
All topics are considered from an algorithmic point of view stressing the implications for algorithm design
R2,365
Or split into 4x interest-free payments of 25% on orders over R50
Learn more
23650
@R222pm x 12* 
Ships in 10 - 15 working days
Add to wish listReview this Item
Donate to Against Period Poverty
Product Description
Reflects recent developments in its emphasis on randomized and approximation algorithms and communication models
All topics are considered from an algorithmic point of view stressing the implications for algorithm design
Customer Reviews
No reviews or ratings yet - be the first to create one!
Product Details
General
Imprint | Springer-Verlag |
Country of origin | Germany |
Release date | October 2010 |
Availability | Expected to ship within 10 - 15 working days |
First published | 2005 |
Translators | R. Pruim |
Authors | Ingo Wegener |
Dimensions | 235 x 155 x 21mm (L x W x T) |
Format | Paperback |
Pages | 308 |
Edition | Softcover reprint of hardcover 1st ed. 2005 |
ISBN-13 | 978-3-642-05914-8 |
Barcode | 9783642059148 |
Languages | value |
Subtitles | value |
Categories | |
LSN | 3-642-05914-7 |
Similar Products | Recommended ProductsSee more 
Trending On Loot
Be the first to know about our
latest deals & promos! Subscribe Now
