scientific article; zbMATH DE number 4191126

zbMATH Open0722.68065MaRDI QIDQ3210184FDOQ3210184

Authors: Gaétan Hains 

Publication date: 1990

Title of this publication is not available (Why is that?)

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

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)

Cited In (5)

• Single elementary associative-commutative matching
• Title not available (Why is that?)
• Some complexity theoretic aspects of AC rewriting
• Rewriting Techniques and Applications
• Title not available (Why is that?)

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)