Single elementary associative-commutative matching

DOI10.1023/A:1020122610698MaRDI QIDQ1598445zbMATH OpenOpenAlexFDO

Authors Steven Eker

Publication date 22 May 2002

Published in Journal of Automated Reasoning (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1020122610698

zbMATH Keywords

matching problemposet searching

Mathematics Subject Classification ID

Searching and sorting (68P10) Grammars and rewriting systems (68Q42)

Recommendations

• Complexity of matching problems
• scientific article; zbMATH DE number 3921983
• Publication:3210184
• Tight complexity bounds for term matching problems
• Computational complexity of simultaneous elementary matching problems

Cited in

(14)

• scientific article; zbMATH DE number 1638660 (Why is no real title available?)
• The complexity of counting problems in equational matching
• Some complexity theoretic aspects of AC rewriting
• Single-crossing choice correspondences
• Variadic equational matching in associative and commutative theories
• Associative-commutative discrimination nets
• scientific article; zbMATH DE number 4191126 (Why is no real title available?)
• Variadic equational matching
• Tactics for Reasoning Modulo AC in Coq
• scientific article; zbMATH DE number 2043518 (Why is no real title available?)
• On the parameterized complexity of associative and commutative unification
• On the parameterized complexity of associative and commutative unification
• scientific article; zbMATH DE number 3921983 (Why is no real title available?)
• Rewriting Techniques and Applications

This page was built for publication: Single elementary associative-commutative matching

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