On oblivious branching programs with bounded repetition that cannot efficiently compute CNFs of bounded treewidth
- Submitting institution
-
Birkbeck College
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 188
- Type
- D - Journal article
- DOI
-
10.1007/s00224-016-9714-0
- Title of journal
- Theory of Computing Systems
- Article number
- -
- First page
- 755
- Volume
- 61
- Issue
- -
- ISSN
- 1432-4350
- Open access status
- Compliant
- Month of publication
- October
- Year of publication
- 2016
- URL
-
http://eprints.bbk.ac.uk/id/eprint/17098/
- Supplementary information
-
-
- Request cross-referral to
- -
- Output has been delayed by COVID-19
- No
- COVID-19 affected output statement
- -
- Forensic science
- No
- Criminology
- No
- Interdisciplinary
- No
- Number of additional authors
-
0
- Research group(s)
-
1 - Algorithms, Verification and Software
- Citation count
- 2
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- This paper shows that CNFs of bounded treewidth cannot be efficiently represented by a model called c-OBDD (for an arbitrary c). This result is important because c-OBDDs are branching programs with multiple repetition (up to c). This is the first time where inefficiency of computing CNFs of bounded treewidth has been shown for a branching program of repetition greater than 1.
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -