0
Your cart

Your cart is empty

Books > Computing & IT > General theory of computing

Buy Now

Computational Complexity: A Quantitative Perspective, Volume 196 (Hardcover, New) Loot Price: R4,916
Discovery Miles 49 160
Computational Complexity: A Quantitative Perspective, Volume 196 (Hardcover, New): Marius Zimand

Computational Complexity: A Quantitative Perspective, Volume 196 (Hardcover, New)

Marius Zimand

Series: North-Holland Mathematics Studies

 (sign in to rate)
Loot Price R4,916 Discovery Miles 49 160 | Repayment Terms: R461 pm x 12*

Bookmark and Share

Expected to ship within 12 - 17 working days

There has been a common perception that computational complexity is a theory of "bad news" because its most typical results assert that various real-world and innocent-looking tasks are infeasible. In fact, "bad news" is a relative term, and, indeed, in some situations (e.g., in cryptography), we want an adversary to not be able to perform a certain task. However, a "bad news" result does not automatically become useful in such a scenario. For this to happen, its hardness features have to be quantitatively evaluated and shown to manifest extensively.
The book undertakes a quantitative analysis of some of the major results in complexity that regard either classes of problems or individual concrete problems. The size of some important classes are studied using resource-bounded topological and measure-theoretical tools. In the case of individual problems, the book studies relevant quantitative attributes such as approximation properties or the number of hard inputs at each length.
One chapter is dedicated to abstract complexity theory, an older field which, however, deserves attention because it lays out the foundations of complexity. The other chapters, on the other hand, focus on recent and important developments in complexity. The book presents in a fairly detailed manner concepts that have been at the centre of the main research lines in complexity in the last decade or so, such as: average-complexity, quantum computation, hardness amplification, resource-bounded measure, the relation between one-way functions and pseudo-random generators, the relation between hard predicates and pseudo-random generators, extractors, derandomization of bounded-error probabilistic algorithms, probabilistically checkable proofs, non-approximability of optimization problems, and others.
The book should appeal to graduate computer science students, and to researchers who have an interest in computer science theory and need a good understanding of computational complexity, e.g., researchers in algorithms, AI, logic, and other disciplines.
-Emphasis is on relevant quantitative attributes of important results in complexity.
-Coverage is self-contained and accessible to a wide audience.
-Large range of important topics including: derandomization techniques, non-approximability of optimization problems, average-case complexity, quantum computation, one-way functions and pseudo-random generators, resource-bounded measure and topology.

General

Imprint: Elsevier Science Ltd
Country of origin: United Kingdom
Series: North-Holland Mathematics Studies
Release date: July 2004
First published: July 2004
Authors: Marius Zimand
Dimensions: 240 x 165 x 19mm (L x W x T)
Format: Hardcover
Pages: 352
Edition: New
ISBN-13: 978-0-444-82841-5
Categories: Books > Computing & IT > General theory of computing > General
Books > Computing & IT > Applications of computing > General
Books > Academic & Education > Professional & Technical > Mathematics
Promotions
LSN: 0-444-82841-9
Barcode: 9780444828415

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..

Systems Analysis And Design In A…
John Satzinger, Robert Jackson, … Hardcover  (1)
R1,282 R1,152 Discovery Miles 11 520
Oracle 12c - SQL
Joan Casteel Paperback  (1)
R1,321 R1,183 Discovery Miles 11 830
Systems Analysis And Design
Scott Tilley Hardcover R1,301 R1,167 Discovery Miles 11 670
Foundations Of Computer Science
Behrouz Forouzan Paperback R1,188 R1,072 Discovery Miles 10 720
Introduction to Computer Theory
Daniel I. A. Cohen Paperback  (4)
R6,786 Discovery Miles 67 860
Discovering Computers 2018 - Digital…
Misty Vermaat, Steven Freund, … Paperback R1,271 R1,142 Discovery Miles 11 420
Dynamic Web Application Development…
David Parsons, Simon Stobart Paperback R1,258 R1,128 Discovery Miles 11 280
Program Construction - Calculating…
Roland Backhouse Paperback R2,712 Discovery Miles 27 120
Introduction to the Theory of…
Michael Sipser Hardcover R1,270 R1,136 Discovery Miles 11 360
Discovering Computers, Essentials…
Susan Sebok, Jennifer Campbell, … Paperback R1,207 R1,082 Discovery Miles 10 820
Distributed Systems - Concurrency and…
Matthieu Perrin Hardcover R1,875 Discovery Miles 18 750
Principles of Biomedical Informatics
Ira J. Kalet Ph.D. Hardcover R1,797 Discovery Miles 17 970

See more

Partners