|
|
books
| book details |
Complexity Theory: Exploring the Limits of Efficient Algorithms
By (author) Ingo Wegener, Translated by R. Pruim
|
| on special |
normal price: R 3 389.95
Price: R 3 219.95
|
| book description |
Complexity theory is the theory of determining the necessary resources for the solution of algorithmic problems and, therefore, the limits of what is possible with the available resources. An understanding of these limits prevents the search for non-existing efficient algorithms. This textbook considers randomization as a key concept and emphasizes the interplay between theory and practice: New branches of complexity theory continue to arise in response to new algorithmic concepts, and its results - such as the theory of NP-completeness - have influenced the development of all areas of computer science. The topics selected have implications for concrete applications, and the significance of complexity theory for today's computer science is stressed throughout.
| product details |
Normally shipped |
Publisher | Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
Published date | 13 Oct 2010
Language |
Format | Paperback / softback
Pages | 308
Dimensions | 235 x 155 x 0mm (L x W x H)
Weight | 0g
ISBN | 978-3-6420-5914-8
Readership Age |
BISAC | computers / programming / general
| other options |
|
|
To view the items in your trolley please sign in.
| sign in |
|
|
|
| specials |
|
An epic love story with the pulse of a thriller that asks: what would you risk for a second chance at first love?
|
Emil Coetzee, a civil servant in his fifties, is washing blood off his hands when the ceasefire is announced.
|
This is indeed a story of mercy and the redemption it offers.
|
|
|
|
