Contatto
Come acquistare
Consegna
Guida all'acquisto
Probabilistic Methods for Algorithmic Discrete Mathematics
Inglese
262 b
Fino a 30 giorni per il reso
I clienti hanno acquistato anche
/
In brossura
7.19
€
/
In brossura
37.91
€
/
In brossura
24.80
€
/
In brossura
24.29
€
/
In brossura
29.09
€
The book gives an accessible account of modern pro- babilistic methods for analyzing combinatorial structures and algorithms. Each topic is approached in a didactic manner but the most recent developments are linked to the basic ma- terial. Extensive lists of references and a detailed index will make this a useful guide for graduate students and researchers. Special features included: - a simple treatment of Talagrand inequalities and their applications- an overview and many carefully worked out examples of the probabilistic analysis of combinatorial algorithms- a discussion of the "exact simulation" algorithm (in the context of Markov Chain Monte Carlo Methods)- a general method for finding asymptotically optimal or near optimal graph colouring, showing how the probabilistic method may be fine-tuned to explit the structure of the underlying graph- a succinct treatment of randomized algorithms and derandomization techniques
Informazioni sul libro
Inglese
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
/
In brossura
38.49
€
Ciao! Sono Libroamiko, il tuo consulente di libri.
Come posso aiutarti?