P Versus NP Problem: Complexity Class, Theoretical Computer Science, Decision Problem, Polynomial Time, Subset Sum

Priser från
347,03

Utvalda

JäMFöR ALLA WEBBUTIKER (2)

Beskrivning

P Versus NP Problem: Complexity Class, Theoretical Computer Science, Decision Problem, Polynomial Time, Subset Sum

Description Beskrivning
Product Specifications Produktspecifikationer
Relaterade resultat Relaterade resultat
Next
Previous

Jämför webbutiker (2)

Sortera efter:

347,03 kr

347,03 kr

Beskrivning (0)

P Versus NP Problem: Complexity Class, Theoretical Computer Science, Decision Problem, Polynomial Time, Subset Sum

Produktspecifikationer

Märke Betascript Publishers
EAN
  • 9786130335588

Betascript Publishers

NP-Complete: Computational Complexity Theory, Class, Polynomial Time, Unsolved Problems in Computer Science,...

338,06 kr
Jämför 2 butiker 2 Butiker

Betascript Publishers

Travelling Salesman Problem: Combinatorial Optimization, Operations Research, Theoretical Computer Science, Computational Complexity...

288,45 kr
Jämför 2 butiker 2 Butiker

OmniScriptum

Search Problem: Computational Complexity Theory, Computability Decision Problem

477,95 kr
Jämför 2 butiker 2 Butiker

OmniScriptum

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

851,19 kr
Jämför 2 butiker 2 Butiker
Utvalt Val
347,03 kr
Til butik