Tell your friends about this item:
Randomized Algorithms: Approximation, Generation, and Counting - Distinguished Dissertations Russ Bubley Softcover reprint of the original 1st ed. 2001 edition
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 | Books Paperback Book (Book with soft cover and glued back) |
| Released | September 16, 2011 |
| ISBN13 | 9781447111801 |
| Publishers | Springer London Ltd |
| Pages | 152 |
| Dimensions | 155 × 235 × 9 mm · 254 g |
| Language | English |
See all of Russ Bubley ( e.g. Paperback Book )
Christmas presents can be returned until 31 January