Advice (complexity): Computational Complexity theory, Turing machine, Decision problem, class, Boolean circuit, Nondeterministic algorithm

Prix à partir de
28,72

En vedette

COMPARER TOUS LES MAGASINS EN LIGNE (2)

Description

Advice (complexity): Computational Complexity theory, Turing machine, Decision problem, class, Boolean circuit, Nondeterministic algorithm

Description Description
Product Specifications Spécifications du produit
Résultats connexes Résultats connexes
Next
Previous

Comparer les boutiques en ligne (2)

Shop
Prix
Affranchissement
Prix total
Amazon Logo
28,72 €
Gratuit
28,72 €
Voir l’offre
Gratuit Shipping Costs
Amazon Marketplace Logo
28,72 €
Gratuit
28,72 €
Voir l’offre
Gratuit Shipping Costs
Description (0)

Advice (complexity): Computational Complexity theory, Turing machine, Decision problem, class, Boolean circuit, Nondeterministic algorithm

Spécifications du produit

Marque OmniScriptum
EAN
  • 9786132856326

OmniScriptum

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

33,69 €
Comparer 2 magasins 2 magasins

OmniScriptum

Game complexity: Combinatorial theory, tree, Branching factor, Computational complexity Asymptotic analysis

33,69 €
Comparer 2 magasins 2 magasins

OmniScriptum

Majority Function: Boolean Logic, Circuit Complexity, AC0, Logical Gate, Circuits.

116,00 €
Comparer 2 magasins 2 magasins

Independently Published

COMPUTATIONAL Algorithm ENGINEERING: Design Complexity Optimization Graph Methods and Numerical Computation

12,83 €
Comparer 2 magasins 2 magasins
Choix en vedette
28,72 €
Voir l’offre