The Design of Approximation Algorithms
1787 Kč
Sleva až 70% u třetiny knih
Designed as a textbook for graduate courses on algorithms, this book presents efficient algorithms that find provably near-optimal solutions.
| Autor: | Williamson David G. |
| Nakladatel: | Cambridge University Press |
| ISBN: | 9780521195270 |
| Rok vydání: | 2011 |
| Jazyk : | Angličtina |
| Vazba: | Hardback |
| Počet stran: | 518 |
Mohlo by se vám také líbit..
-
Access to History for the IB Diploma...
Williamson David G.
-
Access to History for Cambridge Inte...
Williamson David G.
-
The Third Reich
Williamson David G.
-
Access to History: War and Peace: In...
Williamson David G.
-
Mining of Massive Datasets
Leskovec, Jure (Stanford University, California); Rajaraman, Anand; Ullman, Jeffrey David (Stanford University, Californ
-
A Hands-On Introduction to Data Science
Shah, Chirag (University of Washington)
-
Machine Learning for Asset Managers
De Prado, Lopez
-
Game Theory Basics
Von Stengel, Rudiger
-
Mathematics for Machine Learning
Deisenroth, Marc Peter (University College London); Faisal, A. Aldo (Imperial College London); Ong, Cheng Soon
-
A Level Comp 2 Computer Science OCR
Surrall, Alistair; Hamflett, Adam
-
Introduction to Applied Linear Algebra
Boyd, Stephen P.
-
Natural Language Processing
Zhang-Yue, Zhou
-
A/AS Level Computer Science for WJEC...
Surrall, Alistair; Hamflett, Adam
-
Applied Stochastic Differential Equat...
Sarkka, Simo (Aalto University, Finland); Solin, Arno (Aalto University, Finland)
-
Foundations of Cryptography: Volume ...
Goldreich, Oded
-
Wireless Communications and Networkin...
Saad, Walid (Virginia Polytechnic Institute and State University); Bennis, Mehdi (University of Oulu, Finland); Mozaffar