论文信息 - Monte-Carlo Approximation Algorithms for Enumeration Problems - 字舞流文

Monte-Carlo Approximation Algorithms for Enumeration Problems

Richard M. Karp | Michael Luby | Neal Madras | M. Luby | R. Karp | N. Madras

[1] Avi Wigderson,et al. Deterministic simulation of probabilistic constant depth circuits , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[2] Richard M. Karp,et al. Monte-Carlo algorithms for the planar multiterminal network reliability problem , 1985, J. Complex..

[3] Richard M. Karp,et al. Monte-Carlo algorithms for enumeration and reliability problems , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[4] J. Scott Provan,et al. The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected , 1983, SIAM J. Comput..

[5] M. Luby. Monte-carlo methods for estimating system reliability , 1983 .

[6] Leslie G. Valiant,et al. The Complexity of Enumeration and Reliability Problems , 1979, SIAM J. Comput..