The complexity of counting problems in equational matching

DOI10.1006/jsco.1995.1054zbMath0854.68043OpenAlexW2054470545MaRDI QIDQ1914166

Miki Hermann, Phokion G. Kolaitis

Publication date: 13 August 1996

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jsco.1995.1054

zbMATH Keywords

computational complexityequational matching

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items (4)

Unification algorithms cannot be combined in polynomial time ⋮ Anti-patterns for rule-based languages ⋮ Regular expression order-sorted unification and matching ⋮ Unification algorithms cannot be combined in polynomial time.

This page was built for publication: The complexity of counting problems in equational matching