Computational Complexity: A Quantitative Perspective

Nonfiction, Science & Nature, Mathematics, Discrete Mathematics, Computers, Advanced Computing, Theory, Reference & Language, Reference
Cover of the book Computational Complexity: A Quantitative Perspective by Marius Zimand, Elsevier Science
View on Amazon View on AbeBooks View on Kobo View on B.Depository View on eBay View on Walmart
Author: Marius Zimand ISBN: 9780080476667
Publisher: Elsevier Science Publication: July 7, 2004
Imprint: Elsevier Science Language: English
Author: Marius Zimand
ISBN: 9780080476667
Publisher: Elsevier Science
Publication: July 7, 2004
Imprint: Elsevier Science
Language: English

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.

View on Amazon View on AbeBooks View on Kobo View on B.Depository View on eBay View on Walmart

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.

More books from Elsevier Science

Cover of the book Progress in Optics by Marius Zimand
Cover of the book Advances in Quantum Chemistry: Lowdin Volume by Marius Zimand
Cover of the book Multiple Stressors in River Ecosystems by Marius Zimand
Cover of the book Ecotoxicology by Marius Zimand
Cover of the book Practical Scientific Computing by Marius Zimand
Cover of the book Advances in Heterocyclic Chemistry by Marius Zimand
Cover of the book Medical Device Design by Marius Zimand
Cover of the book Thermosets and Composites by Marius Zimand
Cover of the book Domestic Violence Spills Over into the Workplace by Marius Zimand
Cover of the book Coulson and Richardson’s Chemical Engineering by Marius Zimand
Cover of the book Pulmonary Endocrine Pathology by Marius Zimand
Cover of the book Emergency Preparedness for Business Professionals by Marius Zimand
Cover of the book Chemistry and Biology by Marius Zimand
Cover of the book Internet Security by Marius Zimand
Cover of the book Modern Applications of Plant Biotechnology in Pharmaceutical Sciences by Marius Zimand
We use our own "cookies" and third party cookies to improve services and to see statistical information. By using this website, you agree to our Privacy Policy