Browse by Journal and Volume

Group by: Author(s) | Date | School | No Grouping

Jump to: R

Number of items: 1.

R

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 Thu Nov 21 04:28:22 2024 GMT.