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
-
Mining of Massive Datasets
Leskovec, Jure (Stanford University, California); Rajaraman, Anand; Ullman, Jeffrey David (Stanford University, Californ
-
Mathematics for Machine Learning
Deisenroth, Marc Peter (University College London); Faisal, A. Aldo (Imperial College London); Ong, Cheng Soon
-
Quantum Computing for Computer Scien...
Yanofsky, Noson S.
-
Machine Learning for Asset Managers
De Prado, Lopez
-
Learning Scientific Programming with ...
Hill, Christian
-
Modern Compiler Implementation in Java
Appel, Andrew W.
-
Computer Age Statistical Inference, S...
Efron, Bradley
-
A Hands-On Introduction to Data Science
Shah, Chirag (University of Washington)
-
Machine Learning Refined
Watt, Jeremy (Northwestern University, Illinois); Borhani, Reza (Northwestern University, Illinois); Katsaggelos, Aggelo
-
Sentiment Analysis
Liu, Bing
-
Brain-Computer Interfacing
Rao, Rajesh P. N.
-
Python for Linguists
Hammond, Michael; Wellington, Jerry
-
Data Mining and Machine Learning
Zaki, Mohammed J.
-
Cambridge International AS & A L...
Piper, Tony
-
Neuronal Dynamics
Gerstner, Wulfram (Ecole Polytechnique Federale de Lausanne); Kistler, Werner M.; Naud, Richard (University of Ottawa);