SNP (Complexity): Computational Complexity Theory, Class, Graph Optimization Problem, Ronald Fagin, Fagin's Theorem

Prijzen vanaf
41,32

Uitgelicht

VERGELIJK ALLE AANBIEDERS (2)

Beschrijving

SNP (Complexity): Computational Complexity Theory, Class, Graph Optimization Problem, Ronald Fagin, Fagin's Theorem

Description Beschrijving
Product Specifications Productspecificaties
Gerelateerde resultaten Gerelateerde resultaten
Next
Previous

Vergelijk aanbieders (2)

Sorteren op:

€ 41,32

€ 41,32

Beschrijving (0)

SNP (Complexity): Computational Complexity Theory, Class, Graph Optimization Problem, Ronald Fagin, Fagin's Theorem

Productspecificaties

Merk OmniScriptum
EAN
  • 9786131244827

OmniScriptum

Reduction (Complexity): Computability Theory, Computational Complexity Problem, Class

47,49
Vergelijk 2 shops 2 shops

OmniScriptum

EXPTIME: EXPTIME, Computational Complexity theory, class, Decision problem, DTIME, P (complexity), NP...

36,96
Vergelijk 2 shops 2 shops

OmniScriptum

Promise Problem: Computational Complexity Theory, Decision Problem, Hamiltonian Graph

95,35
Vergelijk 2 shops 2 shops

Alphascript Publishing

complexity Class: Computational theory, problem, Abstract machine, Big O notation, NP (complexity),...

31,57
Vergelijk 2 shops 2 shops
Uitgelichte Keuze
41,32
Naar shop