Tipsa dina vänner om produkten:
Randomized Algorithms: Approximation, Generation, and Counting - Distinguished Dissertations Russ Bubley Softcover reprint of the original 1st ed. 2001 edition
Pris
SEK 1.069
Beställningsvara
Förväntad leverans 7 - 15 jan 2026
Julklappar kan bytas fram till 31:e januari
Lägg till din iMusic-önskelista
eller
Randomized Algorithms: Approximation, Generation, and Counting - Distinguished Dissertations
Russ Bubley
Randomized Algorithms discusses two problems of fine pedigree: counting and generation, both of which are of fundamental importance to discrete mathematics and probability.
152 pages, biography
| Media | Böcker Pocketbok (Bok med mjukt omslag och limmad rygg) |
| Releasedatum | 16 september 2011 |
| ISBN13 | 9781447111801 |
| Utgivare | Springer London Ltd |
| Antal sidor | 152 |
| Mått | 155 × 235 × 9 mm · 254 g |
| Språk | Engelska |
Se alt med Russ Bubley ( t.ex. Pocketbok )