Hardness transitions and uniqueness of acyclic colouring.
M. A. ShaluCyriac AntonyPublished in: Discret. Appl. Math. (2024)
Keyphrases
- np hard
- acyclic conjunctive queries
- np complete
- relational database theory
- conjunctive queries
- database schemes
- computational complexity
- sufficient conditions
- phase transition
- np hardness
- boolean formulae
- special case
- lower bound
- data sets
- neural network
- worst case
- query processing
- learning theory
- state transitions
- fixed parameter tractable
- search algorithm
- databases