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

Prix à partir de
116,00

En vedette

COMPARER TOUS LES MAGASINS EN LIGNE (2)

Description

Amazon Advice (complexity): Computational complexity theory, Turing machine, Decision problem, Complexity class, Boolean circuit, Nondeterministic algorithm
Description Description
Product Specifications Spécifications du produit
Related Products Produits connexes
?>
Next
Previous

Comparer les boutiques en ligne (2)

Shop
Prix
Affranchissement
Prix total
Amazon Logo
116,00 €
Gratuit
116,00 €
Voir l’offre
Gratuit Shipping Costs
Amazon Marketplace Logo
116,00 €
Gratuit
116,00 €
Voir l’offre
Gratuit Shipping Costs
Description (1)

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

Spécifications du produit

Marque OmniScriptum
EAN
  • 9786132856326

Prix mis à jour pour la dernière fois le :

OmniScriptum

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

136,00 €
Comparer 2 magasins 2 magasins

OmniScriptum

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

136,00 €
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

Leading in Complexity: Bridging Theory and Practice Decision Making

12,70 €
Comparer 2 magasins 2 magasins
Choix en vedette
116,00 €
Voir l’offre