Near-Optimal Complexity Bounds for Fragments of the Skolem Problem.

S. Akshay Nikhil Balaji Aniket Murhekar Rohith Varma Nikhil Vyas

Published in: STACS (2020)

Keyphrases

complexity bounds
first order logic
worst case
constraint networks
query containment
databases
expressive power
objective function
computational complexity
schema mappings