Computational Complexity of Counting and Sampling(Discrete Mathematics and Its Applications) P 408 p. 19
Miklos, Istvan 著
目次
1. Background on computational complexity2. Algebraic dynamic programming and monotone computations3. Linear algebraic algorithms. The power of subtracting4. #P-complete counting problems5. Holographic algorithms6. Methods of random generations7. Mixing of Markov chains and their applications in the theory ofcounting and sampling8. Approximable counting and sampling problems
カート
カートに商品は入っていません。
