scientific article; zbMATH DE number 4191126

MaRDI QIDQ3210184zbMATH OpenFDO

Authors Gaétan Hains

Publication date 1990

zbMATH Keywords

NP-completeAC-matchingcomplexity of term matching

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Complexity of computation (including implicit computational complexity) (03D15)

Recommendations

• Complexity of matching problems
• scientific article; zbMATH DE number 3921983
• Single elementary associative-commutative matching
• Tight complexity bounds for term matching problems
• Computational complexity of simultaneous elementary matching problems

Cited in

(5)

• Single elementary associative-commutative matching
• Some complexity theoretic aspects of AC rewriting
• scientific article; zbMATH DE number 1931655 (Why is no real title available?)
• scientific article; zbMATH DE number 3921983 (Why is no real title available?)
• Rewriting Techniques and Applications

This page was built for publication:

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