On Oblivious Branching Programs with Bounded Repetition that Cannot Efficiently Compute CNFs of Bounded Treewidth.
Igor RazgonPublished in: Theory Comput. Syst. (2017)
Keyphrases
- bounded treewidth
- np complete
- conjunctive queries
- highly parallelizable
- decision problems
- boolean functions
- polynomial size
- relational learning
- cnf formula
- computational complexity
- first order logic
- np hard
- fixed parameter tractable
- inductive logic programming
- query evaluation
- utility function
- recursive least squares
- data sources
- bounded degree
- machine learning