Store besparelser
Hurtig levering
Fri fragt over 499,-
Gemte
Log ind
0
Kurv
Kurv
P, NP, and NP-Completeness
- The Basics of Computational Complexity
Engelsk
Bogcover for P, NP, and NP-Completeness af Oded Goldreich, 9780521122542
Specifikationer
Sprog:
Engelsk
Sider:
216
ISBN-13:
9780521122542
Indbinding:
Paperback
ISBN-10:
0521122546
Udg. Dato:
16 aug 2010
Størrelse i cm:
22,8 x 15,6 x 1,3
Oplagsdato:
16 aug 2010
Forfatter(e):

P, NP, and NP-Completeness

- The Basics of Computational Complexity
Engelsk
Paperback 2010
Format:

Bog beskrivelse
This undergraduate introduction to computational complexity gives a wide perspective on two central issues in theoretical computer science. It starts with the relevant background in computability, including Turing machines, search and decision problems, algorithms, circuits, and complexity classes, and then focuses on the P versus NP Question and the theory of NP-completeness.
... Vis mere

Forlags Vejl. pris
489,37 kr
Hos Booktok
433 kr
spar 12%
Læg i kurv nu
Sikker betaling
23 - 25 hverdage

Specifikationer
Sprog:
Engelsk
Sider:
216
ISBN-13:
9780521122542
Indbinding:
Paperback
ISBN-10:
0521122546
Udg. Dato:
16 aug 2010
Størrelse i cm:
22,8 x 15,6 x 1,3
Oplagsdato:
16 aug 2010
Forfatter(e):
Finder produkter...
Kategori sammenhænge