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

Prices from
145.79

Featured

COMPARE ALL WEBSHOPS (2)

Description

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

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

Compare webshops (2)

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

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

Product specifications

Brand OmniScriptum
EAN
  • 9786131192104

OmniScriptum

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

€ 127.10
Compare 2 stores 2 stores

OmniScriptum

RL (Complexity): Computational Complexity Theory, Class, Logarithmic Space, Polynomial Time, Probabilistic Turing Machine

€ 108.41
Compare 2 stores 2 stores

OmniScriptum

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

€ 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
€ 145.79
To Shop