Stochastic enumeration method for counting NP-hard problems
From MaRDI portal
Publication:352890
DOI10.1007/s11009-011-9242-yzbMath1269.65012MaRDI QIDQ352890
Publication date: 5 July 2013
Published in: Methodology and Computing in Applied Probability (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11009-011-9242-y
Markov chain Monte Carlo method; numerical examples; self-avoiding walks; splitting; satisfiability; one-step-look-ahead algorithm; polynomial time decision making; rare-event; sample search methods; sequential importance sampling algorithm; stochastic enumeration
60J22: Computational methods in Markov chains
65C05: Monte Carlo methods
60C05: Combinatorial probability
65C40: Numerical analysis or methods applied to Markov chains