A probabilistic algorithm for \(k\)-SAT based on limited local search and restart (Q1348911): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 14:04, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A probabilistic algorithm for \(k\)-SAT based on limited local search and restart |
scientific article |
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
