No small nondeterministic read-once branching programs for CNFs of bounded treewidth

In this paper, given a parameter k, we demonstrate an infinite class of sc cnfs of treewidth at most k of their primary graphs such that the equivalent nondeterministic read-once branching programs (sc nrobps) are of size at least nck for some universal constant c. Thus we rule out the possibility of fixed-parameter space complexity of sc nrobps parameterized by the smallest treewidth of the equivalent sc cnf.