Some of the hardest computational problems have been successfully attacked through the use of probabilistic algorithms, which have an element of randomness to them. Concepts from the field of probability are also increasingly useful in analyzing the performance of algorithms, broadening our understanding beyond that provided by the worst-case or average-case analyses.This book surveys both of these emerging areas on the interface of the mathematical sciences and computer science. It is designed to attract new researchers to this area and provide them with enough background to begin explorations of their own.
Acquista questo ebook e ricevine 1 in più GRATIS!
Lingua Inglese ● Formato PDF ● Pagine 188 ● ISBN 9780309596176 ● Casa editrice National Academies Press ● Pubblicato 1992 ● Scaricabile 3 volte ● Moneta EUR ● ID 7147815 ● Protezione dalla copia Adobe DRM
Richiede un lettore di ebook compatibile con DRM