How many needles are in a haystack, or how to solve #P-complete counting problems fast

Methodology and Computing in Applied Probability

Volumn 8, Issue 1, 2006, Pages 5-51

  Rubinstein, Reuven Y ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

P complete problems; Cross entropy; Hamilton cycles; Rare event probability estimation; Self avoiding walks; Stochastic and simulation based optimization

Indexed keywords

EID: 33747590565     PISSN: 13875841     EISSN: 15737713     Source Type: Journal    
DOI: 10.1007/s11009-006-7287-0     Document Type: Article

References (13)

1. T. M. Cover and J. A. Thomas, Elements of Information Theory, John Wiley & Sons, inc, 1991.
2. P. T. de Boer, D. P. Kroese, S. Mannor, and R. Y. Rubinstein, "A tutorial on the cross-entropy method," Annals of Operations Research, 2005.
3. M. Dyer, A. Frieze, and M. Jerrum, "Approximately counting Hamiltonian paths and cycles in dense graphs," SIAM Journal of Computing vol. 27(5) pp. 1262-1272, 1998.
4. M. Jerrum, A. Sinclair, and E. Vigoda, "A polynomial-time approximation algorithm for the permanent of a matrix with the nonnegarive entries," Journal of the ACM vol. 51(4) pp. 671-697, 2004.
5. Jun Gu et al., "Algorithms for the satisfiability (SAT) problem: A survey," DIMACS Series in Discrete Mathematics, 1991.
6. J. N. Kapur and Kesavan H. K., Entropy Optimization with Applications, Academic Press, Inc., 1992.
7. D. Lieber, R. Y. Rubinstein, and D. Elmakis, "Quick estimation of rare events in stochastic networks," IEEE Transactions on Reliability Systems vol. 46(2) pp. 254-265, 1997.
8. R. Motwani and R. Raghavan, Randomized Algorithms, Cambridge University Press, 1997.
9. R. Y. Rubinstein, "The cross-entropy method for combinatorial and continuous optimization," Methodology and Computing in Applied Probability vol. 2 pp. 127-190, 1999.
10. R. Y. Rubinstein, "A stochastic minimum cross-entropy method for combinatorial optimization and rare-event estimation," Methodology and Computing in Applied Probability (1) pp. 1-46, 2005.
11. R. Y. Rubinstein and B. Melamed, Modern Simulation and Modeling, John Wiley & Sons, Inc., 1998.
12. R. Y. Rubinstein and D. P. Kroese, The Cross-Entropy Method: A Unified Approach to Combinatorial Optimization, Monte-Carlo Simulation and Machine Learning, Springer, 2004.
13. D. J. A. Welsh, Complexity: Knots, Colouring and Counting, Cambridge University Press, 1993.