Login / Signup

Subsequences with Gap Constraints: Complexity Bounds for Matching and Analysis Problems.

Joel D. DayMaria KoscheFlorin ManeaMarkus L. Schmid
Published in: ISAAC (2022)
Keyphrases
  • complexity bounds
  • np complete
  • query containment
  • database systems
  • worst case
  • pattern matching
  • constraint networks
  • knowledge representation
  • response time
  • constraint programming