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

Prices from
108.41

Featured

COMPARE ALL WEBSHOPS (2)

Description

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

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

Compare webshops (2)

Sort by:

€ 108.41

€ 108.41

Description (0)

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

Product specifications

Brand OmniScriptum
EAN
  • 9786133708341

OmniScriptum

Constraint satisfaction: Artificial intelligence, satisfaction problem, Simplex algorithm, programming, Prolog, Complexity,

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

Constraint satisfaction problem: (mathematics), Variable satisfaction, Artificial intelligence, Operations research

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