Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: On the read-once property of branching programs and CNFs of bounded
  treewidth   In this paper we prove a space lower bound of $n^{\Omega(k)}$ for
non-deterministic (syntactic) read-once branching programs ({\sc nrobp}s) on
functions expressible as {\sc cnf}s with treewidth at most $k$ of their primal
graphs. This lower bound rules out the possibility of fixed-parameter space
complexity of {\sc nrobp}s parameterized by $k$.
  We use lower bound for {\sc nrobp}s to obtain a quasi-polynomial separation
between Free Binary Decision Diagrams and Decision Decomposable Negation Normal
Forms, essentially matching the existing upper bound introduced by Beame et al.
and thus proving the tightness of the latter.

31
The categories of this paper are: ao-sci
32
The categories of this paper are: atom-ph
15
The categories of this paper are: nucl-ex
37
The categories of this paper are: supr-con
8
The categories of this paper are: hep-ex
25
The categories of this paper are: patt-sol
34
The categories of this paper are: chem-ph
24
The categories of this paper are: dg-ga
35
The categories of this paper are: mtrl-th
20
The categories of this paper are: acc-phys
30
The categories of this paper are: q-alg
2
The categories of this paper are: math
5
The categories of this paper are: gr-qc
7
The categories of this paper are: hep-th
9
The categories of this paper are: nlin
23
The categories of this paper are: solv-int