Pastāsti draugiem par šo preci:
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
| Mediji | Grāmatas Paperback Book (Grāmata ar mīksto vāku un līmēto muguru) |
| Izlaists | 2013. gada 7. decembris |
| ISBN13 | 9781461348863 |
| Izdevēji | Springer-Verlag New York Inc. |
| Lapas | 996 |
| Izmēri | 155 × 235 × 56 mm · 1,47 kg |
| Valoda | Angļu |
| Redaktors | Pardalos, Panos M. |
| Redaktors | Rajasekaran, Sanguthevar |
| Redaktors | Reif, J.H. |
| Redaktors | Rolim, Jose |
Vairāk no Sanguthevar Rajasekaran
Rādīt visuMere med samme udgiver
Skatīt visus Sanguthevar Rajasekaran ( piem., Paperback Book un Hardcover Book )