M. Jetrum and A. Sinclair. The Maxkov chain Monte Caxlo method: An approach to approximate counting and integration. In Dorit S. Hochbaum, editor, Approximation Algorithms for NP-hard Problems, chapter 12, pages 482-520. PWS Publishing, Boston, 1996. Home/Search Document Not in Database Summary Related Articles |
This paper is cited in the following contexts:
One-Dimensional Quantum Walks - Ambainis, Bach, Nayak, Vishwanath.. (3 citations) (Correct)
....(c) to generate the state at time t l. gorithm similar to that of Papadimitriou [27] that gives a the most efficient known solution to 3SAT. In general, Markov chain simulation has emerged as a powerful algorithmic tool and has had a profound impact on random sampling and approximate counting [18]. Among its numerous applications are estimating the volume of convex bodies [10] see also [23] for recent progress on this problem) and approximating the permanent [17] Very recently, Jerrum, Sinclair and Vigoda [19] used this approach to solve the long standing open problem of approximating ....
M. Jetrum and A. Sinclair. The Maxkov chain Monte Caxlo method: An approach to approximate counting and integration. In Dorit S. Hochbaum, editor, Approximation Algorithms for NP-hard Problems, chapter 12, pages 482-520. PWS Publishing, Boston, 1996.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC