P, Np, and Np-Completeness: The Basics of Computational Complexity - Image 1

£34.80

Cambridge University Press P, Np, and Np-Completeness: The Basics of Computational Complexity

Name: P, Np, and Np-Completeness: The Basics of Computational Complexity
Brand: Cambridge University Press
Price: 34.8 GBP
Availability: InStock

Computer Science

It has never been this cheap. We have no record of a lower price.

£35 today · cheaper than every other day in the last 3 months

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)

Historical

Generating forecast…

Price Distribution

Price distribution over 48 days • 2 price levels

Days at Price

Current Price

Price Analysis

Most common price: £35 (46 days, 95.8%)

Price range: £35 - £38

Price levels: 2 different prices over 48 days

Description

The focus of this book is the P versus NP Question and the theory of NP-completeness. It also provides adequate preliminaries regarding computational problems and computational models. The P versus NP Question asks whether or not finding solutions is harder than checking the correctness of solutions. An alternative formulation asks whether or not discovering proofs is harder than verifying their correctness. It is widely believed that the answer to these equivalent formulations is positive, and this is captured by saying that P is different from NP. Although the P versus NP Question remains unresolved, the theory of NP-completeness offers evidence for the intractability of specific problems in NP by showing that they are universal for the entire class. Amazingly enough, NP-complete problems exist, and furthermore hundreds of natural computational problems arising in many different areas of mathematics and science are NP-complete.

Product Specifications

Brand: Cambridge University Press
Format: paperback
ASIN: 0521122546
Category: Books > Subjects > Computing & Internet > Computer Science
Domain: Amazon UK
Release Date: 21 October 2010
Listed Since: 24 December 2009

Barcode

No barcode data available

Cambridge University Press P, Np, and Np-Completeness: The Basics of Computational Complexity

It has never been this cheap. We have no record of a lower price.

Price History & Forecast

Price Distribution

Price Analysis

Description

Product Specifications

Barcode

Similar Products You Might Like

The P=NP Question and Gödel’s Lost Letter

Open Problems in Mathematics and Computational Science

Logical Foundations of Proof Complexity (Perspectives in Logic)

Theory of Semi-Feasible Algorithms (Monographs in Theoretical Computer Science. An EATCS Series)

Algorithmic Graph Theory

The Foundations of Computability Theory

Bounded Arithmetic, Propositional Logic and Complexity Theory: 60 (Encyclopedia of Mathematics and its Applications, Series Number 60)

Natural Complexity: A Modeling Handbook (Primers in Complex Systems): 5

Computable Analysis: An Introduction (Texts in Theoretical Computer Science. An EATCS Series)

An Introduction to Formal Languages and Machine Computation

Simplicity is Complex: Foundations of Cyber-Physical System Design

Combinatorial Mathematics

Completeness and Reduction in Algebraic Complexity Theory: 7 (Algorithms and Computation in Mathematics, 7)

Computational Semantics with Functional Programming

125 Problems in Text Algorithms: with Solutions

Forcing with Random Variables and Proof Complexity: 382 (London Mathematical Society Lecture Note Series, Series Number 382)

New Computational Paradigms: Changing Conceptions of What is Computable

The Mathematics of Logic: A Guide to Completeness Theorems and their Applications

Compliance Quantified: An Introduction to Data Verification

Principles of Parallel Scientific Computing: A First Guide to Numerical Concepts and Programming Methods (Undergraduate Topics in Computer Science)

Computational Models of Conditioning

Computation, Proof, Machine: Mathematics Enters a New Age

Kolmogorov Complexity and Computational Complexity (Monographs in Theoretical Computer Science. An EATCS Series)

Complexity in Information Theory