A probabilistic algorithm for \(k\)-SAT based on limited local search and restart (Q1348911)
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 probabilistic algorithm for \(k\)-SAT based on limited local search and restart |
scientific article; zbMATH DE number 1742776
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A probabilistic algorithm for \(k\)-SAT based on limited local search and restart |
scientific article; zbMATH DE number 1742776 |
Statements
A probabilistic algorithm for \(k\)-SAT based on limited local search and restart (English)
0 references
21 May 2002
0 references
satisfiability problem
0 references
NP-completeness
0 references
0.89411587
0 references
0.89250386
0 references
0.88509136
0 references
0.8789239
0 references
0.8765505
0 references
