On the relative succinctness of sentential decision diagrams (Q2322709)
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: On the relative succinctness of sentential decision diagrams |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the relative succinctness of sentential decision diagrams |
scientific article |
Statements
On the relative succinctness of sentential decision diagrams (English)
0 references
5 September 2019
0 references
complexity theory
0 references
decomposable negation normal forms
0 references
knowledge compilation
0 references
ordered binary decision diagrams
0 references
sentential decision diagrams
0 references
storage access functions
0 references
0 references
0 references
0 references
0 references
0.8722485899925232
0 references
0.8137890100479126
0 references
0.8003828525543213
0 references
0.7976958751678467
0 references
0.7954710125923157
0 references
