1
0
0
0
0
Computational complexity of counting and sampling
- 作者： Miklos, Istvan (Mathematician), author.
- 其他題名：
- Discrete mathematics and its applications.
- 出版： Boca Raton : CRC Press, Taylor & Francis Group
- 叢書名： Discrete mathematics and its applications
- 主題： Computational complexity. , Sampling (Statistics)
- ISBN： 9781138035577 (pbk.): US$106.95 、 1138035572 (pbk.) 、 1138070831 、 9781138070837
- 資料類型: 圖書
- 內容註: Includes bibliographical references and index. Background on computational complexity -- Algebraic dynamic programming and monotone computations -- Linear algebraic algorithms. The power of subtracting -- #P-complete counting problems -- Holographic algorithms -- Methods of random generations -- Mixing of Markov chains and their applications in the theory of counting and sampling -- Approximable counting and sampling problems.
- 摘要註: "The purpose of the book is to give a comprehensive and detailed introduction to the computational complexity of counting and sampling. The book will consist of three main topics: I. Counting problems that are solvable in polynomial running time, II. Approximation algorithms for counting and sampling, III. Holographic algorithms"--
-
讀者標籤：
- 系統號： 005476617 | 機讀編目格式
館藏資訊
