文章基本信息
- 标题：A polynomial-time approximation algorithm for the permanent of a matrix with non-negative entries
- 本地全文：下载
- 作者：Mark Jerrum, Eric Vigoda
- 期刊名称：Electronic Colloquium on Computational Complexity
- 印刷版ISSN：1433-8092
- 出版年度：2000
- 卷号：2000
- 出版社：Universität Trier, Lehrstuhl für Theoretische Computer-Forschung
- 摘要：We present a fully-polynomial randomized approximation scheme
for computing the permanent of an arbitrary matrix
with non-negative entries.
- 关键词：Keywords:
Approximation Algorithms, Markov Chain Monte Carlo, permanent, randomised algorithms, Rapid mixing
