On oblivious branching programs with bounded repetition that cannot efficiently compute CNFs of bounded treewidth (Q2408558)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On oblivious branching programs with bounded repetition that cannot efficiently compute CNFs of bounded treewidth |
scientific article |
Statements
On oblivious branching programs with bounded repetition that cannot efficiently compute CNFs of bounded treewidth (English)
0 references
12 October 2017
0 references
