An enumerative algorithm for \#2SAT (Q283678)
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: An enumerative algorithm for \#2SAT |
scientific article; zbMATH DE number 6580818
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An enumerative algorithm for \#2SAT |
scientific article; zbMATH DE number 6580818 |
Statements
An enumerative algorithm for \#2SAT (English)
0 references
13 May 2016
0 references
\#SAT problem
0 references
counting models
0 references
enumerative algorithm
0 references
efficient counting
0 references
0 references
0.9251313
0 references
0.9117311
0 references
0 references
0.8846451
0 references
0 references
0 references
0.8666617
0 references
0 references
