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
SKU: 3bd7234f49e25e7ff6a1ab48289c194d
Rating: 4 (1 reviews)

Amazon
P, Np, and Np Completeness: The Basics of Computational Complexity

1/1

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

Amazon Marketplace

Prices from

37.89

Featured

	£ 37.89	To Shop
	£ 39.88	To Shop

COMPARE ALL WEBSHOPS (2)

Description

Amazon Marketplace Pages: 214, Edition: Illustrated, Paperback, Cambridge University Press

Compare webshops (2)

Shop

Price

£ 37.89

To Shop

£ 39.88

To Shop

Description (2)

Amazon Marketplace

Pages: 214, Edition: Illustrated, Paperback, Cambridge University Press

Amazon

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

Brand	Cambridge University Press
EAN	9780521122542

Prices were last updated on: 05-04-2026, 03:25

Independently Published

The Algebra of Complexity: Rethinking P vs NP

£ 8.24

Compare 2 stores 2 stores

Independently Published

THE GEOMETRY OF COMPLEXITY: A Structural Proof that P ̸= NP

£ 19.90

Compare 2 stores 2 stores

Independently Published

THE GEOMETRY OF COMPLEXITY: A Structural Proof that P ̸= NP

£ 13.77

Compare 2 stores 2 stores

Algorithms Decoded: From Big O to P vs. NP: A Complete Guide...

£ 4.59

More Information More Info

Featured Choice

£ 37.89

To Shop

P, Np, and Np Completeness: The Basics of Computational Complexity

Description

Product specifications