Unique Games Conjecture: Computational Complexity Theory, Subhash Khot, NP Hard, Hardness of Approximation

Prijzen vanaf
41,40

Uitgelicht

VERGELIJK ALLE AANBIEDERS (2)

Beschrijving

Unique Games Conjecture: Computational Complexity Theory, Subhash Khot, NP Hard, Hardness of Approximation

Description Beschrijving
Product Specifications Productspecificaties
Gerelateerde resultaten Gerelateerde resultaten
Next
Previous

Vergelijk aanbieders (2)

Sorteren op:

€ 41,40

€ 41,40

Beschrijving (0)

Unique Games Conjecture: Computational Complexity Theory, Subhash Khot, NP Hard, Hardness of Approximation

Productspecificaties

Merk OmniScriptum
EAN
  • 9786131317750

OmniScriptum

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

95,35
Vergelijk 2 shops 2 shops

Hardness of Approximation Between P and NP

98,99
Meer informatie Meer info

OmniScriptum

Weakly NP Complete: Computational Complexity, Complete, Hard

41,32
Vergelijk 2 shops 2 shops

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
41,40
Naar shop