Complexity of nilpotent unification and matching problems.

DOI10.1006/inco.1999.2849zbMath1045.68603OpenAlexW2032424775MaRDI QIDQ1854363

Paliath Narendran, D. A. Wolfram, Qing Guo

Publication date: 14 January 2003

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/inco.1999.2849

zbMATH Keywords

equational unification

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Mechanization of proofs and logical operations (03B35)

Related Items

Symbolic protocol analysis in the union of disjoint intruder theories: combining decision procedures

Cites Work

• Complexity of unification problems with associative-commutative operators
• The undecidability of the second-order unification problem
• Unification in commutative theories, Hilbert's basis theorem, and Gröbner bases
• Fast Parallel Computation of Hermite and Smith Forms of Polynomial Matrices
• An Efficient Unification Algorithm
• Unification algorithms cannot be combined in polynomial time
• An algorithm for distributive unification
• The complexity of satisfiability problems
• The Clausal Theory of Types
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item