Typical case complexity of satisfiability algorithms and the threshold phenomenon (Q2581549): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 07:51, 3 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Typical case complexity of satisfiability algorithms and the threshold phenomenon |
scientific article |
Statements
Typical case complexity of satisfiability algorithms and the threshold phenomenon (English)
0 references
10 January 2006
0 references
Satisfiability
0 references
Threshold
0 references
Probabilistic analysis
0 references
\(k\)-CNF
0 references
