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)

Shop
Price
Amazon Logo
€ 127.10
To Shop
Amazon Marketplace Logo
€ 127.10
To Shop
Description (0)

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

Product specifications

Brand OmniScriptum
EAN
  • 9786132868176

Featured Choice
€ 127.10
To Shop