Hitting minors on bounded treewidth graphs. III. Lower bounds.

Julien Baste Ignasi Sau Dimitrios M. Thilikos

Published in: J. Comput. Syst. Sci. (2020)

Keyphrases

bounded treewidth
lower bound
np complete
np hard
upper bound
decision problems
boolean functions
highly parallelizable
conjunctive queries
objective function
relational learning
graph theoretic
fixed parameter tractable
database systems
constraint satisfaction
integrity constraints