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

Prix à partir de
33,69

En vedette

COMPARER TOUS LES MAGASINS EN LIGNE (2)

Description

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

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

Comparer les boutiques en ligne (2)

Trier par:

33,69 €

33,69 €

Description (0)

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

Spécifications du produit

Marque OmniScriptum
EAN
  • 9786132868176

OmniScriptum

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

28,72 €
Comparer 2 magasins 2 magasins

OmniScriptum

AI complete: Artificial intelligence, Strong AI, NP complete, hard, Computational complexity theory,...

38,63 €
Comparer 2 magasins 2 magasins

OmniScriptum

Boolean Function: Propositional Formula, All or Nothing Transform, Authentication

196,00 €
Comparer 2 magasins 2 magasins

OmniScriptum

Leslie Valiant: Harvard School of Engineering and Applied Sciences, Theoretical computer science,...

28,72 €
Comparer 2 magasins 2 magasins
Choix en vedette
33,69 €
Voir l’offre