Average-Case Complexity (Foundations and Trends (R) in Theoretical Computer Science) - Image 1

Out of Stock

This item is currently unavailable

Average-Case Complexity (Foundations and Trends (R) in Theoretical Computer Science)

Architecture & Microprocessors

Out of Stock

Price data last checked 73 day(s) ago - refreshing...

View at Amazon

One email. No newsletter. No nudges.

Gone for 144 days. Could come back at any time — we're watching for you.

Out of stock 144 days · last price £67 · longest previous gap was 1 days

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 503 days • 503 data points (No recent data available)

Historical

Generating forecast...

Price Distribution

Price distribution over 503 days • 1 price levels

Days at Price

Price Analysis

Most common price: £67 (503 days, 100.0%)

Price range: £67 - £67

Price levels: 1 different prices over 503 days

Description

Average-Case Complexity is a thorough survey of the average-case complexity of problems in NP. The study of the average-case complexity of intractable problems began in the 1970s, motivated by two distinct applications: the developments of the foundations of cryptography and the search for methods to "cope" with the intractability of NP-hard problems. This survey looks at both, and generally examines the current state of knowledge on average-case complexity. Average-Case Complexity is intended for scholars and graduate students in the field of theoretical computer science. The reader will also discover a number of results, insights, and proof techniques whose usefulness goes beyond the study of average-case complexity.

Product Specifications

Format: paperback
ASIN: 1933019492
Category: Books > Subjects > Computing & Internet > Computer Science > Architecture & Microprocessors
Domain: Amazon UK
Release Date: 10 December 2006
Listed Since: 27 December 2006

Barcode

No barcode data available

Average-Case Complexity (Foundations and Trends (R) in Theoretical Computer Science)

Gone for 144 days. Could come back at any time — we're watching for you.

Price History & Forecast

Price Distribution

Price Analysis

Description

Product Specifications

Barcode

Similar Products You Might Like

Computational Complexity: A Conceptual Perspective: 0

Computational Complexity: A Modern Approach

Theory of Computational Complexity (Wiley Series in Discrete Mathematics and Optimization)

Limits of Computation: An Introduction to the Undecidable and the Intractable

Complexity and Real Computation

The Complexity Theory Companion (Texts in Theoretical Computer Science. An EATCS Series)

Algorithmic Complexity and Telecommunication Problems

Introduction to the Theory of Complexity (Prentice Hall International Series in Computer Science)

Computability and Complexity: Foundations and Tools for Pursuing Scientific Applications (Undergraduate Topics in Computer Science)

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

Algorithms and Complexity: 11th International Conference, CIAC 2019, Rome, Italy, May 27–29, 2019, Proceedings: 11485 (Lecture Notes in Computer Science, 11485)

Complexity Theory Retrospective II (Springer Series in Statistics)

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)

The Nature of Computation

P, NP, and NP-Completeness: The Basics of Computational Complexity

Computability and Complexity

What Can Be Computed? – A Practical Guide to the Theory of Computation

Complexity: Hierarchical Structures: Hierarchical Structures and Scaling in Physics: 6 (Cambridge Nonlinear Science Series, Series Number 6)

Theory of Computation (Texts in Computer Science)

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

Descriptive Complexity (Texts in Computer Science)

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

Demystifying Computation: A Hands-on Introduction

Current Trends in Theoretical Computer Science: Entering the 21st Century