Browse by Staff
 | Up a level |
Group by: Item Type | No Grouping
Jump to: Article
Number of items: 1.
Article
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.