Login / Signup

Palindrome complexity bounds for primitive substitution sequences.

David DamanikDouglas Zare
Published in: Discret. Math. (2000)
Keyphrases
  • complexity bounds
  • worst case
  • query containment
  • constraint networks
  • multi dimensional
  • transitive closure
  • database
  • special case
  • logic programs
  • np complete