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)

Cambridge University Press
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

41.78

Featured

	£ 41.78	To Shop
	£ 41.78	To Shop

COMPARE ALL WEBSHOPS (2)

Description

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

Compare webshops (2)

Shop

Price

£ 41.78

To Shop

£ 41.78

To Shop

Description (1)

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

Brand	Cambridge University Press
EAN	9780521122542

Prices were last updated on: 13-06-2026, 00:31

Cambridge University Press

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

£ 38.38

More Information More Info

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

Featured Choice

£ 41.78

To Shop

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

Description

Product specifications