Accelerating Simulated Annealing for the Permanent and Combinatorial Counting Problems (Q3532571): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q56341081, #quickstatements; #temporary_batch_1710328330639 |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1137/050644033 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2060222605 / rank | |||
Normal rank | |||
Latest revision as of 19:07, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Accelerating Simulated Annealing for the Permanent and Combinatorial Counting Problems |
scientific article |
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
