On the Complexity of Linear and Stratified Context Matching Problems (2001)
Cached
Download Links
- [kiste-5.ki.informatik.uni-frankfurt.de]
- [www.loria.fr]
- DBLP
Other Repositories/Bibliography
| Citations: | 15 - 1 self |
BibTeX
@MISC{Schmidt-Schauß01onthe,
author = {Manfred Schmidt-Schauß and Jürgen Stuber},
title = {On the Complexity of Linear and Stratified Context Matching Problems},
year = {2001}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We investigate the complexity landscape of context matching with respect to the number of occurrences of variables (i.e. linearity vs. varity 2) and various restrictions of stratification. We show that stratified context matching (SCM) and varity 2 context matching are NP-complete, but that stratified simultaneous monadic context matching (SSMCM) is in P. SSMCM is equivalent to stratified simultaneous word matching (SSWM). We also show that the linear and the Comon-restricted case are in P and of time complexity O(n³). We give an algorithm for context matching and discuss how the performance of the general case can be improved through the use of information derived from polynomial approximations of the problem.
