Contatto
Come acquistare
Consegna
Guida all'acquisto
Randomized Algorithms: Approximation, Generation, and Counting
Inglese
263 b
30 giorni per il reso
I clienti hanno acquistato anche
/
In brossura
6.19
€
/
In brossura
34.79
€
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.
Informazioni sul libro
Inglese
Categorie
Regala questo libro oggi stesso
È facile
1 Aggiungi il libro al carrello e scegli la consegna come regalo 2 Ti invieremo subito il buono 3 Il libro arriverà all'indirizzo del destinatarioPotrebbe interessarti anche
/
Rigido
854.39
€
/
Rigido
115.29
€
/
In brossura
14.89
€
/
In brossura
35.79
€
Ciao! Sono Libroamiko, il tuo consulente di libri.
Come posso aiutarti?