OmniScriptum

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

1/1

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

Prix à partir de

116,00

En vedette

	116,00 €	Voir l’offre
	116,00 €	Voir l’offre
COMPARER TOUS LES MAGASINS EN LIGNE (2)

Description

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

Lire la suite

Comparer les boutiques en ligne (2)

Shop

Prix

Affranchissement

Prix total

116,00 €

Gratuit

116,00 €

Voir l’offre

Gratuit

116,00 €

Gratuit

116,00 €

Voir l’offre

Gratuit

Description (1)

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

Lire la suite

Spécifications du produit

Marque	OmniScriptum
EAN	9786132856326

OmniScriptum

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

Comparer 2 magasins 2 magasins

OmniScriptum

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

Comparer 2 magasins 2 magasins

OmniScriptum

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

Comparer 2 magasins 2 magasins

North-Holland

Theories of Computational Complexity

Comparer 2 magasins 2 magasins

Choix en vedette

116,00 €

Voir l’offre