Schaefer's Dichotomy Theorem: Computational Complexity Theory, Computer Science, NP- Complete

Prices from
127.10

Featured

COMPARE ALL WEBSHOPS (2)

Description

Schaefer's Dichotomy Theorem: Computational Complexity Theory, Computer Science, NP- Complete

Description Description
Product Specifications Product specifications
Related results Related results
Next
Previous

Compare webshops (2)

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

Schaefer's Dichotomy Theorem: Computational Complexity Theory, Computer Science, NP- Complete

Product specifications

Brand OmniScriptum
EAN
  • 9786131171598

OmniScriptum

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

€ 127.10
Compare 2 stores 2 stores

OmniScriptum

Sipser-Lautemann Theorem: Computational Complexity Theory, Polynomial Hierarchy, Michael Sipser

€ 145.79
Compare 2 stores 2 stores

OmniScriptum

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

€ 127.10
Compare 2 stores 2 stores

OmniScriptum

Parameterized Complexity: Computational Complexity Theory, Vertex Cover Problem, Parameter Space

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