Kaikki kirjat 25 % alennuksella koodilla: BOOKS

  • check Yli 10 miljoonaa kirjaa
  • check Uutuuksia joka päivä
  • check Yli 1 miljoona asiakasta luottaa meihin
  • check Hyvät hinnat ja alennukset
  • check Toimitus koko Eurooppaan

Randomized Algorithms: Approximation, Generation, and Counting - Russ Bubley

englanti
2011-09-16
127,04 € 169,38 €

-25% koodilla BOOKS

Toimittajalla varastossa

Toimitus 12-18 arkipäivässä

30 päivän palautusoikeus

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 "How many are there?" and "What does it look like on average?" of families of combinatorial structures, answers are often difficult to find -- we can be blocked by seemingly intractable algorithms. Randomized A ... Täydellinen kuvaus

Saatat myös pitää

Kuvaus

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 "How many are there?" and "What does it look like on average?" of families of combinatorial structures, answers are often difficult to find -- we can be blocked by seemingly intractable algorithms. Randomized Algorithms shows how to get around the problem of intractability with the Markov chain Monte Carlo method, as well as highlighting the method's natural limits. It uses the technique of coupling before introducing "path coupling" a new technique which radically simplifies and improves upon previous methods in the area.

Lisätietoja

Kirjoittaja Russ Bubley
Julkaisija Springer London
Series Distinguished Dissertations
Julkaisuvuosi 2011
Kannen tyyppi Pehmeäkantinen
EAN 9781447111801
Kirjoita oma arvostelusi
Arvostelet: Randomized Algorithms: Approximation, Generation, and Counting
Arvostelusi:

Goodreads-arvostelut

127,04 € 169,38 €