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

Prices from
127.10

Featured

COMPARE ALL WEBSHOPS (2)

Description

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

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

Compare webshops (2)

Sort by:

€ 127.10

€ 127.10

Description (0)

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

Product specifications

Brand OmniScriptum
EAN
  • 9786132868176

OmniScriptum

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

€ 108.41
Compare 2 stores 2 stores

OmniScriptum

Maximum Common Subgraph Isomorphism Problem: Computational complexity theory, Optimization problem, NP-hard, Graph...

€ 127.10
Compare 2 stores 2 stores

OmniScriptum

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

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