Computational Complexity: A Quantitative Perspective (Volume 196) (North-Holland Mathematics Studies, Volume 196) - Image 1

£46.49

Elsevier Computational Complexity: A Quantitative Perspective (Volume 196) (North-Holland Mathematics Studies, Volume 196)

Name: Computational Complexity: A Quantitative Perspective (Volume 196) (North-Holland Mathematics Studies, Volume 196)
Brand: Elsevier
Price: 46.49 GBP
Availability: InStock

Information Systems

This is the most expensive it has ever been. Walk away.

£46 today · previous high £46 · all-time low £45

NEW HERE?

Amazon shows you one price. We show you all of them.

Tosheroon watches Amazon prices so you don't have to. Every product on Amazon has a price history — we make it visible. Set the price you'd actually pay, and we'll email you the second it gets there. No app, no account, one email.

WHAT'S ON THIS PAGE

↓ Price chart
when this has been cheap or pricey

↓ Forecast
where the price is heading next

↓ Statistics
all-time high & low, recent range

↑ Price alert
name your number, we'll email you

Price History & Forecast

Grey patches = out of stock. Cheaper = lower on the chart. Hover for exact prices.

Last 48 days • 48 data points (No recent data available)

Historical

Generating forecast...

Price Distribution

Price distribution over 48 days • 2 price levels

Days at Price

Current Price

Price Analysis

Most common price: £45 (27 days, 56.3%)

Price range: £45 - £46

Price levels: 2 different prices over 48 days

Description

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.

Product Specifications

Brand: Elsevier
Format: hardcover
ASIN: 0444828419
Category: Books > Subjects > Computing & Internet > Computer Science > Information Systems
Domain: Amazon UK
Release Date: 11 July 2004
Listed Since: 05 February 2007

Barcode

No barcode data available

Elsevier Computational Complexity: A Quantitative Perspective (Volume 196) (North-Holland Mathematics Studies, Volume 196)

This is the most expensive it has ever been. Walk away.

Price History & Forecast

Price Distribution

Price Analysis

Description

Product Specifications

Barcode

Similar Products You Might Like

Computational Complexity: A Modern Approach

The Nature of Computation

Computability and Randomness: 51 (Oxford Logic Guides)

Perspectives in Computational Complexity: The Somenath Biswas Anniversary Volume: 26 (Progress in Computer Science and Applied Logic, 26)

Computational Complexity: A Conceptual Perspective

Classical and New Paradigms of Computation and their Complexity Hierarchies: Papers of the conference "Foundations of the Formal Sciences III": 23 (Trends in Logic, 23)

Classical and New Paradigms of Computation and their Complexity Hierarchies: Papers of the conference "Foundations of the Formal Sciences III": 23 (Trends in Logic, 23)

Demystifying Computation: A Hands-on Introduction

Algorithmic Randomness and Complexity: 0 (Theory and Applications of Computability)

Unconventional Computation: 7th International Conference, UC 2008, Vienna, Austria, August 25-28, 2008, Proceedings: 5204 (Lecture Notes in Computer Science, 5204)

Complexity and Approximation: In Memory of Ker-I Ko: 12000 (Lecture Notes in Computer Science, 12000)

Algorithms as a Basis of Modern Applied Mathematics: 404 (Studies in Fuzziness and Soft Computing, 404)

Lower Bounds in Communication Complexity (Foundations and Trends (R) in Theoretical Computer Science)

Springer - Patterns in Permutations and Words Book

Aspects of Complexity: Minicourses in Algorithmics, Complexity and Computational Algebra. Mathematics Workshop, Kaikoura, January 7-15, 2000: 4 (De Gruyter Series in Logic & its Applications, 4)

Algorithms – ESA 2005: 13th Annual European Symposium, Palma de Mallorca, Spain, October 3-6, 2005, Proceedings: 3669 (Lecture Notes in Computer Science, 3669)

From Astrophysics to Unconventional Computation: Essays Presented to Susan Stepney on the Occasion of her 60th Birthday: 35 (Emergence, Complexity and Computation, 35)

New Computational Paradigms: First Conference on Computability in Europe, CiE 2005, Amsterdam, The Netherlands, June 8-12, 2005, Proceedings: 3526 (Lecture Notes in Computer Science, 3526)

Proceedings of ECCS 2014: European Conference on Complex Systems (Springer Proceedings in Complexity)

Mathematics and Computing: ICMC, Haldia, India, January 2015: 139 (Springer Proceedings in Mathematics & Statistics, 139)

Handbook of Computability and Complexity in Analysis (Theory and Applications of Computability)

Algorithmic Combinatorics: Enumerative Combinatorics, Special Functions and Computer Algebra: In Honour of Peter Paule on his 60th Birthday (Texts & Monographs in Symbolic Computation)

Techniques for Designing and Analyzing Algorithms (Chapman & Hall/CRC Cryptography and Network Security Series)

Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing: 850 (Studies in Computational Intelligence, 850)