scientific article; zbMATH DE number 1759404
From MaRDI portal
Publication:4536353
zbMath0996.68070MaRDI QIDQ4536353
Denis Thérien, David Mix Barrington, Pascal Tesson, Chris Moore, Pierre McKenzie
Publication date: 4 November 2002
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Algebraic theory of languages and automata (68Q70) Semigroups in automata theory, linguistics, etc. (20M35) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (6)
Inapproximability results for equations over finite groups ⋮ Complexity issues of checking identities in finite monoids ⋮ Zero testing and equation solving for sparse polynomials on rectangular domains ⋮ Solving a fixed number of equations over finite groups ⋮ Inapproximability results for equations over infinite groups ⋮ The complexity of solving equations over finite groups
This page was built for publication:
