A comparative runtime analysis of heuristic algorithms for satisfiability problems (Q835804)
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: A comparative runtime analysis of heuristic algorithms for satisfiability problems |
scientific article; zbMATH DE number 5600136
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A comparative runtime analysis of heuristic algorithms for satisfiability problems |
scientific article; zbMATH DE number 5600136 |
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
0.7899864315986633
0 references
0.7828941345214844
0 references
0.7733255624771118
0 references
