On the read-once property of branching programs and CNFs of bounded treewidth (Q309788)
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 6624619
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the read-once property of branching programs and CNFs of bounded treewidth |
scientific article; zbMATH DE number 6624619 |
Statements
On the read-once property of branching programs and CNFs of bounded treewidth (English)
0 references
7 September 2016
0 references
read-once branching programs
0 references
CNFs
0 references
bounded treewidth
0 references
parameterized complexity
0 references
space complexity
0 references
lower bounds
0 references
0.9254441261291504
0 references
0.8402209877967834
0 references
0.8002924919128418
0 references
0.7968829870223999
0 references
0.7845247983932495
0 references
