The number of satisfying assignments of random 2‐SAT formulas (Q6074640)
From MaRDI portal
!
WARNING
This is the item page for this Wikibase entity, intended for internal use and editing purposes.
Please use the normal view instead:
scientific article; zbMATH DE number 7749469
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.8361074924468994
0 references
0.8331253528594971
0 references
0.8317285180091858
0 references
0.8304121494293213
0 references
0.8156455159187317
0 references
