On the read-once property of branching programs and CNFs of bounded treewidth (Q309788): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Decomposable negation normal form / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4411139 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Treewidth in Verification: Local vs. Global / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A note on read-$k$ times branching programs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Boolean function complexity. Advances and frontiers. / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4527043 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: No Small Nondeterministic Read-Once Branching Programs for CNFs of Bounded Treewidth / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Branching Programs and Binary Decision Diagrams / rank | |||
Normal rank |
Latest revision as of 12:49, 12 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On the read-once property of branching programs and CNFs of bounded treewidth |
scientific article |
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