P, NP, and NP-Completeness
1187 Kč
Sleva až 70% u třetiny knih
Starting from the basics of computability, this undergraduate introduction focuses on the P versus NP Question and the theory of NP-completeness.
Autor: | Goldreich, Oded |
Nakladatel: | Cambridge University Press |
ISBN: | 9780521122542 |
Rok vydání: | 2010 |
Jazyk : | Angličtina |
Vazba: | Paperback |
Počet stran: | 216 |
Mohlo by se vám také líbit..
-
Foundations of Cryptography: Volume ...
Goldreich, Oded
-
Gods and Humans in Medieval Scandinavia
Wellendorf, Jonas (University of California, Berkeley)
-
KJV Large Print Text Bible KJ650:T
-
Female Friends and the Making of Tra...
Pullin, Naomi (University of Cambridge)
-
The Darkness of God
TURNER DENYS
-
Remus
Wiseman, Timothy Peter (University of Exeter)
-
The Cambridge Companion to Muhammad
-
Lebanon
Farha, Mark
-
NKJV Pitt Minion Reference Edition N...
-
KJV Pitt Minion Reference Edition KJ...
-
The Cambridge Guide to Jewish History...
-
KJV Turquoise Reference Bible, Black...
-
KJV Large Print Text Bible, Black Fr...
-
BCP Standard Edition Prayer Book Dar...
-
NASB Clarion Reference Bible NS486:X...
-
The Elements of New Testament Greek
Duff, Jeremy