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

Prices from
127.10

Featured

COMPARE ALL WEBSHOPS (2)

Description

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

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)

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

Product specifications

Brand OmniScriptum
EAN
  • 9786131261282

OmniScriptum

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

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

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

€ 127.10
Compare 2 stores 2 stores

OmniScriptum

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

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