On oblivious branching programs with bounded repetition that cannot efficiently compute CNFs of bounded treewidth
Razgon, Igor (2017) On oblivious branching programs with bounded repetition that cannot efficiently compute CNFs of bounded treewidth. Theory of Computing Systems 61 , pp. 755-776. ISSN 1432-4350.
|
Text
17098.pdf - Author's Accepted Manuscript Download (405kB) | Preview |
Abstract
In this paper we study complexity of an extension of ordered binary decision diagrams (OBDDs) called c-OBDDs on CNFs of bounded (primal graph) treewidth. In particular, we show that for each k ≥ 3 there is a class of CNFs of treewidth k for which the equivalent c-OBDDs are of size Ω(nk/(8c−4)). Moreover, this lower bound holds if c-OBDDs are non-deterministic and semantic. Our second result uses the above lower bound to separate the above model from sentential decision diagrams (SDDs). In order to obtain the lower bound, we use a structural graph parameter called matching width. Our third result shows that matching width and pathwidth are linearly related.
Metadata
| Item Type: | Article |
|---|---|
| Additional Information: | The final publication is available at Springer via the link above. |
| School: | Birkbeck Faculties and Schools > Faculty of Science > School of Computing and Mathematical Sciences |
| Depositing User: | Administrator |
| Date Deposited: | 22 Nov 2016 06:50 |
| Last Modified: | 09 Aug 2023 12:40 |
| URI: | https://eprints.bbk.ac.uk/id/eprint/17098 |
Statistics
Additional statistics are available via IRStats2.
Archive Staff Only (login required)
 |
Edit/View Item |