Probabilistic and Deterministic Approximations of the Permanent (abstract)
暂无分享,去创建一个
[1] Carsten Lund,et al. On the hardness of computing the permanent of random matrices , 1996, STOC '92.
[2] P. W. Kasteleyn. The Statistics of Dimers on a Lattice , 1961 .
[3] Leslie G. Valiant,et al. The Complexity of Computing the Permanent , 1979, Theor. Comput. Sci..
[4] Michael Luby,et al. Approximating the Permanent of Graphs with Large Factors , 1992, Theor. Comput. Sci..
[5] Mark Jerrum,et al. Approximating the Permanent , 1989, SIAM J. Comput..
[6] P. W. Kasteleyn. The statistics of dimers on a lattice: I. The number of dimer arrangements on a quadratic lattice , 1961 .
[7] Richard J. Lipton,et al. A Monte-Carlo Algorithm for Estimating the Permanent , 1993, SIAM J. Comput..