Sign in

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

S. AkshayNikhil BalajiAniket MurhekarRohith VarmaNikhil 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