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

Priser från
338,06

Utvalda

JäMFöR ALLA WEBBUTIKER (2)

Beskrivning

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

Description Beskrivning
Product Specifications Produktspecifikationer
Relaterade resultat Relaterade resultat
Next
Previous

Jämför webbutiker (2)

Shop
Pris
Amazon Logga
338,06 kr
Til butik
Amazon Marketplace Logga
338,06 kr
Til butik
Beskrivning (0)

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

Produktspecifikationer

Märke Betascript Publishers
EAN
  • 9786130333287

Betascript Publishers

P Versus NP Problem: Complexity Class, Theoretical Computer Science, Decision Problem, Polynomial...

347,03 kr
Jämför 2 butiker 2 Butiker

Betascript Publishers

Theory of Computation: Computer Science, Mathematics, Model Computation, Algorithm, Computability, Computational Complexity...

346,52 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

OmniScriptum

Insertion sort: Sorting algorithm, Comparison sort, Quicksort, Heapsort, Merge Adaptive Time complexity,...

1.229,56 kr
Jämför 2 butiker 2 Butiker
Utvalt Val
338,06 kr
Til butik