On the Computational Complexity of Satisfiability Solving for String Theories
Susmit JhaSanjit A. SeshiaRhishikesh LimayePublished in: CoRR (2009)
Keyphrases
- computational complexity
- np complete
- database
- data structure
- decision problems
- satisfiability problem
- phase transition
- low complexity
- pattern matching
- special case
- sat solving
- stochastic local search
- string matching
- np hard
- edit distance
- davis putnam logemann loveland
- solving problems
- storage requirements
- regular expressions
- computational models
- memory requirements
- combinatorial optimization
- theoretical framework