Publication:4536353
From MaRDI portal
zbMath0996.68070MaRDI QIDQ4536353
Denis Thérien, David Mix Barrington, Pascal Tesson, Chris Moore, Pierre McKenzie
Publication date: 4 November 2002
68Q25: Analysis of algorithms and problem complexity
68Q70: Algebraic theory of languages and automata
20M35: Semigroups in automata theory, linguistics, etc.
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
Related Items
Zero testing and equation solving for sparse polynomials on rectangular domains, Inapproximability results for equations over infinite groups, The complexity of solving equations over finite groups, Inapproximability results for equations over finite groups, Solving a fixed number of equations over finite groups, Complexity issues of checking identities in finite monoids