Tractable and intractable second-order matching problems

DOI10.1007/3-540-48686-0_43MaRDI QIDQ4938678zbMATH OpenFDO

Authors Kouichi Hirata, Keizo Yamada, Masateru Harao

Publication date 23 February 2000

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-48686-0_43

zbMATH Keywords

second-order matching problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Grammars and rewriting systems (68Q42)

Recommendations

• Tractable and intractable second-order matching problems
• scientific article; zbMATH DE number 3921983
• Complexity of matching problems
• Linear higher-order matching is NP-complete
• scientific article; zbMATH DE number 2043532

Cited in

(4)

• Deterministic second-order patterns
• Tractable and intractable second-order matching problems
• Efficient second-order matching
• Rewriting Techniques and Applications

This page was built for publication: Tractable and intractable second-order matching problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4938678)