|
| << previous | next >> |
Journal description
All volumes of the corresponding journal
All issues of the corresponding volume
All articles of the corresponding issues
Details for article 4 of 10 found articles
| Title: |
On Oblivious Branching Programs with Bounded Repetition that Cannot Efficiently Compute CNFs of Bounded Treewidth |
| Author: |
Razgon, Igor |
| Appeared in: |
Theory of computing systems |
| Paging: | Volume 61 (2016) nr. 3 pages 755-776 |
| Year: |
2016 |
| Contents: | |
| Publisher: |
Springer US, New York |
| Source file: |
Elektronische Wetenschappelijke Tijdschriften |
Details for article 4 of 10 found articles
| << previous | next >> |