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

Prices from
127.10

Featured

COMPARE ALL WEBSHOPS (2)

Description

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

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

Compare webshops (2)

Sort by:

€ 127.10

€ 127.10

Description (0)

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

Product specifications

Brand OmniScriptum
EAN
  • 9786131171598

OmniScriptum

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

€ 127.10
Compare 2 stores 2 stores

OmniScriptum

EXPTIME: EXPTIME, Computational Complexity theory, class, Decision problem, DTIME, P (complexity), NP...

€ 108.41
Compare 2 stores 2 stores

OmniScriptum

Pseudorandom Generator Theorem: Computational Complexity Theory, Cryptography,

€ 108.41
Compare 2 stores 2 stores

OmniScriptum

AI-complete: Artificial intelligence, Strong AI, NP-complete, NP-hard, Computational complexity theory, Eric S....

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