On the Complexity of Linear and Stratified : Context Matching Problems - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2003

On the Complexity of Linear and Stratified : Context Matching Problems

Abstract

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.

Domains

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

Dates and versions

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

Identifiers

  • HAL Id : inria-00071656 , version 1

Cite

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 View
1399 Download

Share

Gmail Facebook X LinkedIn More