EXPTIME: EXPTIME, Computational Complexity theory, class, Decision problem, DTIME, P (complexity), NP PSPACE, NEXPTIME, ... hierarchy theorem, Space theorem

Prices from
108.41

Featured

COMPARE ALL WEBSHOPS (2)

Description

EXPTIME: EXPTIME, Computational Complexity theory, class, Decision problem, DTIME, P (complexity), NP PSPACE, NEXPTIME, ... hierarchy theorem, Space theorem

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

Compare webshops (2)

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

EXPTIME: EXPTIME, Computational Complexity theory, class, Decision problem, DTIME, P (complexity), NP PSPACE, NEXPTIME, ... hierarchy theorem, Space theorem

Product specifications

Brand OmniScriptum
EAN
  • 9786130702250

OmniScriptum

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

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

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

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