scientific article; zbMATH DE number 1929957

MaRDI QIDQ4708591zbMATH OpenFDO

Authors Ondčej Klíma

Publication date 18 June 2003

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2420/24200423.htm

zbMATH Keywords

complexityidempotent semigroupsunification

Mathematics Subject Classification ID

Free semigroups, generators and relations, word problems (20M05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Symbolic computation and algebraic computation (68W30)

Recommendations

• scientific article; zbMATH DE number 1759432
• Complexity of unification problems with associative-commutative operators
• On the parameterized complexity of associative and commutative unification
• On the parameterized complexity of associative and commutative unification
• Unification and matching modulo nilpotence
• scientific article; zbMATH DE number 4049047
• Complexity of nilpotent unification and matching problems.
• On unification modulo one-sided distributivity: algorithms, variants and asymmetry
• New algorithms for unification modulo one-sided distributivity and its variants
• Unification Modulo Chaining

Cited in

(1)

• The complexity of the equivalence and equation solvability problems over nilpotent rings and groups.

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 Q4708591)