×


 x 

Shopping cart
Ingo Wegener - Complexity Theory: Exploring the Limits of Efficient Algorithms - 9783642059148 - V9783642059148
Stock image for illustration purposes only - book cover, edition or condition may vary.

Complexity Theory: Exploring the Limits of Efficient Algorithms

€ 97.06
FREE Delivery in Ireland
Description for Complexity Theory: Exploring the Limits of Efficient Algorithms Paperback. Translator(s): Pruim, R. Num Pages: 308 pages, 18 black & white illustrations, biography. BIC Classification: UMB. Category: (P) Professional & Vocational. Dimension: 235 x 155 x 17. Weight in Grams: 485.
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

Product Details

Publisher
Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
Format
Paperback
Publication date
2010
Condition
New
Weight
485g
Number of Pages
308
Place of Publication
Berlin, Germany
ISBN
9783642059148
SKU
V9783642059148
Shipping Time
Usually ships in 15 to 20 working days
Ref
99-15

About Ingo Wegener
The author is a full professor at the Computer Science Department of Dortmund University. He is the author of 8 monographs and more than 150 journal and conference articles. He was head of the German youth competition in computer science and has obtained the university medal for excellent teaching. He is an elected member of the German Academy of Sciences ... Read more

Reviews for Complexity Theory: Exploring the Limits of Efficient Algorithms
From the reviews: This book should be important and useful for students of computer science as an introduction to complexity theory with an emphasis on randomized and approximation algorithms ... . It contains 16 chapters and extends from the foundations of modern complexity theory to recent developments with implications for concrete applications. ... The text is well written ... ... Read more

Goodreads reviews for Complexity Theory: Exploring the Limits of Efficient Algorithms


Subscribe to our newsletter

News on special offers, signed editions & more!