Hitting minors on bounded treewidth graphs. III. Lower bounds.
Julien BasteIgnasi SauDimitrios M. ThilikosPublished in: CoRR (2021)
Keyphrases
- bounded treewidth
- lower bound
- np complete
- np hard
- upper bound
- conjunctive queries
- decision problems
- highly parallelizable
- boolean functions
- relational learning
- query evaluation
- bounded degree
- graph theoretic
- machine learning
- objective function
- graph theory
- integer programming
- machine learning algorithms
- prior knowledge