BIROn - Birkbeck Institutional Research Online

Browse by Journal and Volume

Up a level
Export as [feed] Atom [feed] RSS
Group by: Author(s) | Date | School | No Grouping
Number of items: 1.

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.

This list was generated on Wed Jul 23 01:54:30 2025 BST.