The satisfiability threshold for randomly generated binary constraint satisfaction problems (Q5471050): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: A sharp threshold in proof complexity / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Random constraint satisfaction: A more accurate picture / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A probabilistic proof of an asymptotic formula for the number of labelled regular graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Models and thresholds for random constraint satisfaction problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: When does the giant component bring unsatisfiability? / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The Resolution Complexity of Random Constraint Satisfaction Problems / rank | |||
Normal rank | |||
Latest revision as of 15:33, 24 June 2024
scientific article; zbMATH DE number 5029906
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The satisfiability threshold for randomly generated binary constraint satisfaction problems |
scientific article; zbMATH DE number 5029906 |
Statements
The satisfiability threshold for randomly generated binary constraint satisfaction problems (English)
0 references
6 June 2006
0 references
resolution complexity
0 references
0 references
