| 期刊全稱 | Algorithms for Random Generation and Counting: A Markov Chain Approach | | 影響因子2023 | Alistair Sinclair | | 視頻video | http://file.papertrans.cn/154/153233/153233.mp4 | | 學科分類 | Progress in Theoretical Computer Science | | 圖書封面 |  | | 影響因子 | This monograph is a slightly revised version of my PhD thesis [86], com- pleted in the Department of Computer Science at the University of Edin- burgh in June 1988, with an additional chapter summarising more recent developments. Some of the material has appeared in the form of papers [50,88]. The underlying theme of the monograph is the study of two classical problems: counting the elements of a finite set of combinatorial structures, and generating them uniformly at random. In their exact form, these prob- lems appear to be intractable for many important structures, so interest has focused on finding efficient randomised algorithms that solve them ap- proxim~ly, with a small probability of error. For most natural structures the two problems are intimately connected at this level of approximation, so it is natural to study them together. At the heart of the monograph is a single algorithmic paradigm: sim- ulate a Markov chain whose states are combinatorial structures and which converges to a known probability distribution over them. This technique has applications not only in combinatorial counting and generation, but also in several other areas such as statistical physics and com | | Pindex | Book 1993 |
The information of publication is updating
|
|
|Archiver|手機版|小黑屋|
派博傳思國際
( 京公網(wǎng)安備110108008328)
GMT+8, 2026-1-20 23:25
發(fā)表于 2025-3-21 17:52:31
