Sparse Language: Computational Complexity Theory, Formal Language, String (Computer Science), Polynomial, NP (Complexity)

Prices from
127.10

Sponsored links

COMPARE ALL WEBSHOPS (2)

Description

Sparse Language: Computational Complexity Theory, Formal Language, String (Computer Science), Polynomial, NP (Complexity)

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

Compare webshops (2)

Sponsored links · Some shops pay us a fee

Sort by:

€ 127.10

€ 127.10

Description (0)

Sparse Language: Computational Complexity Theory, Formal Language, String (Computer Science), Polynomial, NP (Complexity)

Product specifications

Brand OmniScriptum
EAN
  • 9786131197499

OmniScriptum

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

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

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

€ 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
Featured Choice
€ 127.10
To Shop