scientific article; zbMATH DE number 1834675
From MaRDI portal
Publication:4779171
zbMath0999.68262MaRDI QIDQ4779171
Denis Thérien, Moore, Cristopher, Pascal Tesson
Publication date: 25 November 2002
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2136/21360537
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Symbolic computation and algebraic computation (68W30) Algebraic theory of languages and automata (68Q70) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (3)
Solving equation systems in ω-categorical algebras ⋮ A discrete homotopy theory for binary reflexive structures ⋮ The complexity of equivalence and isomorphism of systems of equations over finite groups
This page was built for publication:
