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

Prijzen vanaf
124,07

Uitgelicht

VERGELIJK ALLE AANBIEDERS (2)

Beschrijving

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

Description Beschrijving
Product Specifications Productspecificaties
Gerelateerde resultaten Gerelateerde resultaten
Next
Previous

Vergelijk aanbieders (2)

Sorteren op:

€ 124,07

€ 124,07

Beschrijving (0)

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

Productspecificaties

Merk OmniScriptum
EAN
  • 9786132868176

OmniScriptum

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

35,13
Vergelijk 2 shops 2 shops

OmniScriptum

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

95,35
Vergelijk 2 shops 2 shops

OmniScriptum

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

95,35
Vergelijk 2 shops 2 shops

OmniScriptum

Weakly NP Complete: Computational Complexity, Complete, Hard

41,32
Vergelijk 2 shops 2 shops
Uitgelichte Keuze
124,07
Naar shop