On the read-once property of branching programs and CNFs of bounded treewidth.
Igor RazgonPublished in: CoRR (2014)
Keyphrases
- bounded treewidth
- monadic datalog
- np complete
- highly parallelizable
- bounded degree
- conjunctive queries
- polynomial size
- decision problems
- conjunctive normal form
- fixed parameter tractable
- boolean functions
- learning algorithm
- reinforcement learning
- computational complexity
- relational databases
- recursive least squares