Povedzte o tejto položke priateľom:
Handbook of Randomized Computing: Volume I/II - Combinatorial Optimization Sanguthevar Rajasekaran Softcover reprint of the original 1st ed. 2001 edition
Do you have a profile? Prihlásiť sa
Dostávajte upozornenia na nové nahrávky interpreta Sanguthevar Rajasekaran
Pridať do vášho zoznamu prianí na iMusic
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
| Médium | Knihy Paperback Book (Kniha s mäkkou väzbou a lepeným chrbtom) |
| Vydané | 07. decembra 2013 |
| ISBN13 | 9781461348863 |
| Vydavatelia | Springer-Verlag New York Inc. |
| Strany | 996 |
| Rozmery | 155 × 235 × 56 mm · 1,47 kg |
| Jazyk | Angličtina |
| Editor | Pardalos, Panos M. |
| Editor | Rajasekaran, Sanguthevar |
| Editor | Reif, J.H. |
| Editor | Rolim, Jose |