|
Books > Computing & IT > General theory of computing > Data structures
|
Buy Now
Approximative Algorithmen und Nichtapproximierbarkeit (German, Hardcover, illustrated edition)
Loot Price: R1,428
Discovery Miles 14 280
You Save: R303
(18%)
|
|
|
Approximative Algorithmen und Nichtapproximierbarkeit (German, Hardcover, illustrated edition)
Series: de Gruyter Lehrbuch
Expected to ship within 10 - 15 working days
|
The subject matter of this textbook is the treatment of difficult
to solve discrete optimisation problems. The first part presents
fast algorithms which can provide approximate solutions to such
problems. The second part deals with complexity theory and the
non-approximability of optimisation problems. In addition, this
textbook contains numerous application examples, exercises,
illustrations and sections on the basics such as the Turing
machine.
General
Is the information for this product incomplete, wrong or inappropriate?
Let us know about it.
Does this product have an incorrect or missing image?
Send us a new image.
Is this product missing categories?
Add more categories.
Review This Product
No reviews yet - be the first to create one!
|
You might also like..
|
Email address subscribed successfully.
A activation email has been sent to you.
Please click the link in that email to activate your subscription.
Welcome to Loot.co.za!
Sign in / Register |Wishlists & Gift Vouchers |Help | Advanced search
