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

    Birkbeck Faculties and Schools > Faculty of Science > School of Computing and Mathematical Sciences

    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 Sat Jul 27 04:52:32 2024 BST.