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
-
A First Course in Random Matrix Theory
Bouchaud, Jean-Philippe (Centre Commissariat ... l'Energie Atomique (CEA), Saclay); Potters, Marc
-
A/AS Level Computer Science for WJEC...
Surrall, Alistair; Hamflett, Adam
-
Cambridge Series in Statistical and ...
Wainwright, Martin
-
Machine Learning with Neural Networks
Mehlig, Bernhard (Goeteborgs Universitet, Sweden)
-
Foundations of Data Science
Blum, Avrim; Hopcroft, John (Cornell University, New York); Kannan, Ravi
-
Modern Compiler Implementation in Java
Appel, Andrew W.
-
Model-Based Clustering and Classific...
Bouveyron, Charles; Celeux, Gilles; Murphy, T. Brendan (University College Dublin); Raftery, Adrian E. (University of Wa
-
Machine Learning for Asset Managers
De Prado, Lopez
-
Purely Functional Data Structures
Okasaki, Chris (Columbia University, New York)
-
A Hands-On Introduction to Data Science
Shah, Chirag (University of Washington)
-
Bandit Algorithms
Lattimore, Tor (University of Alberta); Szepesvari, Csaba (University of Alberta)
-
Mathematics for Machine Learning
Deisenroth, Marc Peter (University College London); Faisal, A. Aldo (Imperial College London); Ong, Cheng Soon
-
Game Theory Basics
Von Stengel, Rudiger
-
Integer Linear Programming in Comput...
Gusfield, Dan (University of California, Davis)