On oblivious branching programs with bounded repetition that cannot efficiently compute CNFs of bounded treewidth (Q2408558)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On oblivious branching programs with bounded repetition that cannot efficiently compute CNFs of bounded treewidth |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.8402209877967834
0 references
0.8326804041862488
0 references
0.7787941098213196
0 references
0.7771257758140564
0 references
0.7749433517456055
0 references
