Monte-Carlo approximation algorithms for enumeration problems

Journal of Algorithms - Tập 10 Số 3 - Trang 429-448 - 1989
Richard M. Karp1, Michael Luby2, Neal Madras3
1University of California, Berkeley
2University of Toronto, Ontario, Canada
3York University, Ontario, Canada

Tóm tắt

Từ khóa


Tài liệu tham khảo

Ajtai, 1985, Deterministic simulation of probabilistic constant depth circuits, 11

Karp, 1983, Monte-Carlo algorithms for enumeration and reliability problems, 56

Karp, 1985, Monte-Carlo algorithms for planar multiterminal network reliability problems, J. Complexity, 1, 45, 10.1016/0885-064X(85)90021-4

Luby, 1983, Monte-Carlo Methods for Estimating System Reliability

Luby, 1983, Monte-Carlo Algorithms for Planar Multiterminal Network Reliability Problems

Madras, 1987

Provan, 1981

Rényi, 1970

Valiant, 1979, The complexity of enumeration and reliability problems, SIAM J. Comput., 8, 410, 10.1137/0208032