How many needles are in a haystack, or how to solve \#P-complete counting problems fast (Q2433252): 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-006-7287-0 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2048356341 / rank | |||
Normal rank | |||
Revision as of 03:43, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | How many needles are in a haystack, or how to solve \#P-complete counting problems fast |
scientific article |
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
