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

Amazon Maximum Satisfiability Problem: Computational complexity theory, Propositional formula, NP-hard, Boolean satisfiability problem, NP-complete, APX
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
33,69 €
Gratuit
33,69 €
Voir l’offre
Gratuit Shipping Costs
Amazon Marketplace Logo
33,69 €
Gratuit
33,69 €
Voir l’offre
Gratuit Shipping Costs
Description (1)

Maximum Satisfiability Problem: Computational complexity theory, Propositional formula, NP-hard, Boolean satisfiability problem, NP-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

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

Independently Published

Hard Problem of Consciousness: Theory

10,59 €
Comparer 2 magasins 2 magasins

OmniScriptum

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

196,00 €
Comparer 2 magasins 2 magasins
Choix en vedette
33,69 €
Voir l’offre