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

Prices from
108.41

Featured

COMPARE ALL WEBSHOPS (2)

Description

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

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)

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

Product specifications

Brand OmniScriptum
EAN
  • 9786131257681

OmniScriptum

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

€ 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

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

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