Easy cases of probabilistic satisfiability (Q2349813)
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 6446862
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Easy cases of probabilistic satisfiability |
scientific article; zbMATH DE number 6446862 |
Statements
Easy cases of probabilistic satisfiability (English)
0 references
17 June 2015
0 references
probabilistic satisfiability
0 references
CNF formulas
0 references
directed hypergraphs
0 references
partial \(k\)-trees
0 references
balanced matrices
0 references
0.8226286768913269
0 references
0.8207802772521973
0 references
0.8168932199478149
0 references
0.8165883421897888
0 references
0.8165883421897888
0 references
