How many needles are in a haystack, or how to solve \#P-complete counting problems fast (Q2433252)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5068153
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | How many needles are in a haystack, or how to solve \#P-complete counting problems fast |
scientific article; zbMATH DE number 5068153 |
Statements
How many needles are in a haystack, or how to solve \#P-complete counting problems fast (English)
0 references
27 October 2006
0 references
Cross-entropy
0 references
Rare-event probability estimation
0 references
Hamilton cycles
0 references
Self-avoiding walks
0 references
Stochastic and simulation-based optimization
0 references
numerical examples
0 references
algorithms
0 references
dynamic importance sampling
0 references
minimum entropy
0 references
convergence
0 references
confidence intervals
0 references
0 references
0 references
0.8111466765403748
0 references
0.7828453183174133
0 references
0.7799025774002075
0 references
