Typical case complexity of satisfiability algorithms and the threshold phenomenon (Q2581549): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q673601 |
Changed an Item |
||
| Property / author | |||
| Property / author: John V. Franco / rank | |||
Normal rank | |||
Revision as of 10:53, 20 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
