Intersection Non-emptiness and Hardness Within Polynomial Time.
Mateus de Oliveira OliveiraMichael WeharPublished in: DLT (2018)
Keyphrases
- np hardness
- computational complexity
- worst case
- acyclic conjunctive queries
- np hard
- approximation algorithms
- special case
- np complete
- phase transition
- machine learning
- databases
- finite automata
- conjunctive queries
- fixed parameter tractable
- bounded treewidth
- tree automata
- approximation ratio
- learning theory
- upper bound
- objective function
- neural network