EXPTIME: EXPTIME, Computational Complexity theory, class, Decision problem, DTIME, P (complexity), NP PSPACE, NEXPTIME, ... hierarchy theorem, Space theorem

Prijzen vanaf
36,96

Uitgelicht

VERGELIJK ALLE AANBIEDERS (2)

Beschrijving

EXPTIME: EXPTIME, Computational Complexity theory, class, Decision problem, DTIME, P (complexity), NP PSPACE, NEXPTIME, ... hierarchy theorem, Space theorem

Description Beschrijving
Product Specifications Productspecificaties
Gerelateerde resultaten Gerelateerde resultaten
Next
Previous

Vergelijk aanbieders (2)

Sorteren op:

€ 36,96

€ 36,96

Beschrijving (0)

EXPTIME: EXPTIME, Computational Complexity theory, class, Decision problem, DTIME, P (complexity), NP PSPACE, NEXPTIME, ... hierarchy theorem, Space theorem

Productspecificaties

Merk OmniScriptum
EAN
  • 9786130702250

OmniScriptum

Space Hierarchy Theorem: Computational Complexity Theory, Deterministic Turing Machine, Decision Problem, Time Theorem

42,80
Vergelijk 2 shops 2 shops

OmniScriptum

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

41,32
Vergelijk 2 shops 2 shops

OmniScriptum

Sipser Lautemann Theorem: Computational Complexity Theory, Polynomial Hierarchy, Michael

47,22
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
36,96
Naar shop