Randomized Algorithms: Approximation, Generation, and Counting (Distinguished Dissertations)

By R.H. Bubley

Randomized Algorithms discusses two problems of fine pedigree: counting and generation, both of which are of fundamental importance to discrete mathematics and probability. When asking questions like... This description may be from another edition of this product.

• Format: Hardcover
• Language: English
• ISBN: 1852333251
• ISBN13: 9781852333256
• Release Date: November 2000
• Publisher: Springer
• Length: 152 Pages
• Weight: 0.90 lbs.
• Dimensions: 9.3" x 0.8" x 6.3"