A bottom-up algorithm for solving \#2SAT (Q3386918)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A bottom-up algorithm for solving \#2SAT |
scientific article; zbMATH DE number 7291125
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A bottom-up algorithm for solving \#2SAT |
scientific article; zbMATH DE number 7291125 |
Statements
A bottom-up algorithm for solving ♯2SAT (English)
0 references
8 January 2021
0 references
\#2SAT
0 references
counting models
0 references
enumerative algorithm
0 references
graph decomposition
0 references
0.9314128756523132
0 references
0.8168880939483643
0 references
0.7994996309280396
0 references
0.7870184183120728
0 references
0.7852070927619934
0 references
