Login / Signup

The height of piecewise-testable languages and the complexity of the logic of subwords.

Prateek KarandikarPhilippe Schnoebelen
Published in: Log. Methods Comput. Sci. (2019)
Keyphrases
  • databases
  • worst case
  • logic programming
  • piecewise linear
  • formal language
  • computational complexity
  • np hard
  • expressive power
  • decision problems
  • language independent
  • multi valued
  • predicate logic