A comparative runtime analysis of heuristic algorithms for satisfiability problems (Q835804): Difference between revisions
From MaRDI portal
Normalize DOI. |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/J.ARTINT.2008.11.002 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.ARTINT.2008.11.002 / rank | |||
Normal rank | |||
Latest revision as of 04:37, 10 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A comparative runtime analysis of heuristic algorithms for satisfiability problems |
scientific article |
Statements
A comparative runtime analysis of heuristic algorithms for satisfiability problems (English)
0 references
31 August 2009
0 references
Boolean satisfiability
0 references
heuristic algorithms
0 references
random walk
0 references
(1+1) EA
0 references
hybrid algorithm
0 references
expected first hitting time
0 references
runtime analysis
0 references
0 references
