Stochastic enumeration method for counting NP-hard problems (Q352890): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s11009-011-9242-y / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2067049422 / rank | |||
Normal rank | |||
Revision as of 18:04, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Stochastic enumeration method for counting NP-hard problems |
scientific article |
Statements
Stochastic enumeration method for counting NP-hard problems (English)
0 references
5 July 2013
0 references
rare-event
0 references
self-avoiding walks
0 references
satisfiability
0 references
splitting
0 references
Markov chain Monte Carlo method
0 references
numerical examples
0 references
sequential importance sampling algorithm
0 references
stochastic enumeration
0 references
one-step-look-ahead algorithm
0 references
polynomial time decision making
0 references
sample search methods
0 references
