0
Your cart

Your cart is empty

Books > Reference & Interdisciplinary > Communication studies > Coding theory & cryptology

Buy Now

Complexity Theory - Exploring the Limits of Efficient Algorithms (Paperback, Softcover reprint of hardcover 1st ed. 2005) Loot Price: R2,196
Discovery Miles 21 960
Complexity Theory - Exploring the Limits of Efficient Algorithms (Paperback, Softcover reprint of hardcover 1st ed. 2005): R....

Complexity Theory - Exploring the Limits of Efficient Algorithms (Paperback, Softcover reprint of hardcover 1st ed. 2005)

R. Pruim; Ingo Wegener

 (sign in to rate)
Loot Price R2,196 Discovery Miles 21 960 | Repayment Terms: R206 pm x 12*

Bookmark and Share

Expected to ship within 10 - 15 working days

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

General

Imprint: Springer-Verlag
Country of origin: Germany
Release date: October 2010
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
Languages: English
Subtitles: German
Categories: Books > Reference & Interdisciplinary > Communication studies > Coding theory & cryptology
Books > Science & Mathematics > Mathematics > Numerical analysis
Books > Computing & IT > General theory of computing > Mathematical theory of computation
Books > Computing & IT > General theory of computing > Data structures
Books > Computing & IT > Computer programming > Algorithms & procedures
LSN: 3-642-05914-7
Barcode: 9783642059148

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!

Partners