The number of satisfying assignments of random 2‐SAT formulas (Q6074640): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1002/rsa.20993 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1002/RSA.20993 / rank | |||
Normal rank | |||
Latest revision as of 18:12, 30 December 2024
scientific article; zbMATH DE number 7749469
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The number of satisfying assignments of random 2‐SAT formulas |
scientific article; zbMATH DE number 7749469 |
Statements
The number of satisfying assignments of random 2‐SAT formulas (English)
0 references
12 October 2023
0 references
2-SAT
0 references
belief propagation
0 references
satisfiability problem
0 references
