0
Your cart

Your cart is empty

Browse All Departments
  • All Departments
Price
  • R2,500 - R5,000 (1)
  • -
Status
Brand

Showing 1 - 1 of 1 matches in All Departments

Computational Complexity: A Quantitative Perspective, Volume 196 (Hardcover, New): Marius Zimand Computational Complexity: A Quantitative Perspective, Volume 196 (Hardcover, New)
Marius Zimand
R5,035 Discovery Miles 50 350 Ships in 12 - 19 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.

Free Delivery
Pinterest Twitter Facebook Google+
You may like...
Democracy Works - Re-Wiring Politics To…
Greg Mills, Olusegun Obasanjo, … Paperback R320 R290 Discovery Miles 2 900
First Lines of the Practice of Physic
William Cullen Paperback R678 Discovery Miles 6 780
The Musician's Hand - A Clinical Guide
Ian Winspur Hardcover R2,344 Discovery Miles 23 440
Materia Medica Pura
Samuel Hahnemann Paperback R527 Discovery Miles 5 270
Three Treatises - the First Concerning…
James Harris Paperback R637 Discovery Miles 6 370
The Metaphysics of Aristotle
Aristotle Paperback R715 Discovery Miles 7 150
A Free Discussion of the Doctrines of…
Richard Price Paperback R677 Discovery Miles 6 770
The Death Of Democracy - Hitler's Rise…
Benjamin Carter Hett Paperback  (1)
R333 R302 Discovery Miles 3 020
Discovering God's Will For Your Life - A…
Trevor Hudson Paperback R129 R119 Discovery Miles 1 190
Producing History in Spanish Civil War…
Zahira Araguete-Toribio Hardcover R3,182 Discovery Miles 31 820

 

Partners