Complexity Theory - Exploring the Limits of Efficient Algorithms (Hardcover, 2005 ed.)
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,563
Or split into 4x interest-free payments of 25% on orders over R50
Learn more
25630
@R240pm x 12* 
Ships in 12 - 17 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 | April 2005 |
Availability | Expected to ship within 12 - 17 working days |
First published | April 2005 |
Translators | R. Pruim |
Authors | Ingo Wegener |
Dimensions | 235 x 155 x 19mm (L x W x T) |
Format | Hardcover |
Pages | 308 |
Edition | 2005 ed. |
ISBN-13 | 978-3-540-21045-0 |
Barcode | 9783540210450 |
Languages | value |
Subtitles | value |
Categories | |
LSN | 3-540-21045-8 |
Similar Products | Recommended ProductsSee more 
Trending On Loot
Be the first to know about our
latest deals & promos! Subscribe Now
