Dichotomies in the complexity of solving systems of equations over finite semigroups.Theory Comput

Ondˇ rej Kl´ ıma, Pascal Tesson, Denis Th´ erien · 2007 · DOI 10.1007/s00224-005-1279-2

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it

open at publisher browse 1 citing papers

representative citing papers

cs.CC · 2025-02-10 · unverdicted · novelty 6.0

Extends complexity dichotomy for monoid equation solving with promises to include arbitrary relations and finitely generated M.

Showing 1 of 1 citing paper.

Equations over Finite Monoids with Infinite Promises cs.CC · 2025-02-10 · unverdicted · none · ref 24
Extends complexity dichotomy for monoid equation solving with promises to include arbitrary relations and finitely generated M.