Pseudo-Polynomial Time: Computational Complexity Theory, Time Complexity, NP-Complete, NP-Hard

Prices from
127.10

Featured

COMPARE ALL WEBSHOPS (2)

Description

Pseudo-Polynomial Time: Computational Complexity Theory, Time Complexity, NP-Complete, NP-Hard

Description Description
Product Specifications Product specifications
Related Products Related Products
?>
Next
Previous

Compare webshops (2)

Shop
Price
Amazon Logo
€ 127.10
To Shop
Amazon Marketplace Logo
€ 127.10
To Shop
Description (0)

Pseudo-Polynomial Time: Computational Complexity Theory, Time Complexity, NP-Complete, NP-Hard

Product specifications

Brand OmniScriptum
EAN
  • 9786134709293

Prices were last updated on:

OmniScriptum

Maximum satisfiability Problem: Computational complexity theory, Propositional formula, NP hard, Boolean problem, complete, APX

€ 127.10
Compare 2 stores 2 stores

Independently Published

The Algebra of Complexity: Rethinking P vs NP

€ 9.48
Compare 2 stores 2 stores

OmniScriptum

Advice (complexity): Computational Complexity theory, Turing machine, Decision problem, class, Boolean circuit, Nondeterministic algorithm

€ 108.41
Compare 2 stores 2 stores

CD Baby

Complexity Theory

€ 19.94
Compare 2 stores 2 stores
Featured Choice
€ 127.10
To Shop