Login / Signup
On oblivious branching programs with bounded repetition that cannot efficiently compute CNFs of bounded treewidth.
Igor Razgon
Published in:
CoRR (2015)
Keyphrases
</>
bounded treewidth
np complete
highly parallelizable
boolean functions
decision problems
conjunctive queries
cnf formula
polynomial size
relational learning
fixed parameter tractable
data complexity
database
information retrieval
query answering
recursive least squares
bounded degree