Login / Signup

Complexity of Regular Language Matching and Other Decidable Cases of the Satisfiability Problem for Constraints Between Regular Open Terms.

Sebastian Bala
Published in: Theory Comput. Syst. (2006)
Keyphrases
  • satisfiability problem
  • pspace complete
  • np complete
  • temporal logic
  • sat problem
  • search algorithm
  • computational complexity
  • programming language
  • function symbols
  • phase transition
  • orders of magnitude
  • max sat