Recomienda este artículo a tus amigos:
Handbook of Randomized Computing: Volume I/II - Combinatorial Optimization Sanguthevar Rajasekaran Softcover reprint of the original 1st ed. 2001 edition
Handbook of Randomized Computing: Volume I/II - Combinatorial Optimization
Sanguthevar Rajasekaran
A brief introduction to randomized algorithms In the analysis of algorithms, at least three different measures of performance can be used: the best case, the worst case, and the average case. 2 For instance, the worst case run time of Hoare's quicksort is O(n ), whereas its average case run time is only O(nlogn).
1045 pages, 35 black & white illustrations, biography
| Medios de comunicación | Libros Paperback Book (Libro con tapa blanda y lomo encolado) |
| Publicado | 7 de diciembre de 2013 |
| ISBN13 | 9781461348863 |
| Editores | Springer-Verlag New York Inc. |
| Páginas | 996 |
| Dimensiones | 155 × 235 × 56 mm · 1,47 kg |
| Lengua | Inglés |
| Editor | Pardalos, Panos M. |
| Editor | Rajasekaran, Sanguthevar |
| Editor | Reif, J.H. |
| Editor | Rolim, Jose |
Mas por Sanguthevar Rajasekaran
Mostrar todoMere med samme udgiver
Ver todo de Sanguthevar Rajasekaran ( Ej. Paperback Book y Hardcover Book )