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

Prices from
127.10

Featured

COMPARE ALL WEBSHOPS (2)

Description

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

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

Compare webshops (2)

Sort by:

€ 127.10

€ 127.10

Description (0)

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

Product specifications

Brand OmniScriptum
EAN
  • 9786134709293

VDM Verlag

NP-easy: Complexity Class, Polynomial Time, Deterministic Turing Machine

€ 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

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

€ 127.10
Compare 2 stores 2 stores

OmniScriptum

complexity of Constraint Satisfaction: Computational theory, satisfaction, satisfaction problem, NP- complete, P (complexity), 2-satisfiability

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