On the Complexity of Linear and Stratified : Context Matching Problems - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Rapport (Rapport De Recherche) Année : 2003

On the Complexity of Linear and Stratified : Context Matching Problems

Résumé

We give algorithms for linear and for general context matching and discuss how the performance in the general case can be improved through the use of information derived from approximations that can be computed in polynomial time. We investigate the complexity of context matching with respect to the stratification of variable occurrences, where our main results are that stratified context matching is NP-complete, but that stratified simultaneous monadic context matching is in P. SSMCM is equivalent to stratified simultaneous word matching. We also show that the linear and the shared-linear case are in P and of time complexity $O(n^3)$, and that varity 2 context matching, where variables occur at most twice, is NP-complete.

Domaines

Autre [cs.OH]
Fichier principal
Vignette du fichier
RR-4923.pdf (418.21 Ko) Télécharger le fichier

Dates et versions

inria-00071656 , version 1 (23-05-2006)

Identifiants

  • HAL Id : inria-00071656 , version 1

Citer

Manfred Schmidt-Schauss, Jürgen Stuber. On the Complexity of Linear and Stratified : Context Matching Problems. [Research Report] RR-4923, INRIA. 2003, pp.28. ⟨inria-00071656⟩
88 Consultations
1400 Téléchargements

Partager

Gmail Facebook X LinkedIn More