Typical case complexity of satisfiability algorithms and the threshold phenomenon (Q2581549): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.dam.2005.05.008 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.DAM.2005.05.008 / rank | |||
Normal rank | |||
Latest revision as of 08:44, 19 December 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
0 references
0 references
0 references
0 references
