Stochastic enumeration method for counting NP-hard problems (Q352890)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Stochastic enumeration method for counting NP-hard problems |
scientific article; zbMATH DE number 6184655
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Stochastic enumeration method for counting NP-hard problems |
scientific article; zbMATH DE number 6184655 |
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
0 references
0.8619713187217712
0 references
0.861133337020874
0 references
0.8111466765403748
0 references
0.7847399711608887
0 references
0.7723473906517029
0 references
