Accelerating Simulated Annealing for the Permanent and Combinatorial Counting Problems (Q3532571)
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: Accelerating Simulated Annealing for the Permanent and Combinatorial Counting Problems |
scientific article; zbMATH DE number 5358293
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Accelerating Simulated Annealing for the Permanent and Combinatorial Counting Problems |
scientific article; zbMATH DE number 5358293 |
Statements
Accelerating Simulated Annealing for the Permanent and Combinatorial Counting Problems (English)
0 references
28 October 2008
0 references
Markov chain
0 references
Monte Carlo
0 references
simulated annealing
0 references
cooling schedule
0 references
approximate counting problems
0 references
0.812412440776825
0 references
0.8122240900993347
0 references
0.7927577495574951
0 references
0.7772943377494812
0 references
