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

Prijzen vanaf
35,13

Uitgelicht

VERGELIJK ALLE AANBIEDERS (2)

Beschrijving

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

Description Beschrijving
Product Specifications Productspecificaties
Gerelateerde resultaten Gerelateerde resultaten
Next
Previous

Vergelijk aanbieders (2)

Shop
Prijs
Verzendkosten
Totale prijs
Amazon Logo
35,13
Gratis
35,13
Naar shop
Gratis Shipping Costs
Amazon Marketplace Logo
35,13
Gratis
35,13
Naar shop
Gratis Shipping Costs
Beschrijving (0)

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

Productspecificaties

Merk OmniScriptum
EAN
  • 9786133708341

Complexity Classifications of Boolean Constraint Satisfaction Problems

36,60
Meer informatie Meer info

The Complexity of Valued Constraint Satisfaction Problems

129,00
Meer informatie Meer info

Cognitive Technologies The Complexity of Valued Constraint Satisfaction Problems

119,00
Meer informatie Meer info

OmniScriptum

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

138,54
Vergelijk 2 shops 2 shops
Uitgelichte Keuze
35,13
Naar shop