Concepedia
Semigroup Forum · 2009 · 25 citations · 9 references
ComputingComputer ScienceMathematicsAlgorithmsSet TheoryTheory Of ComputationComputational ComplexityDescriptive ComplexityEquivalence CheckingProof ComplexityStructural ComplexityType CheckingComplexityIdentity ProofsMonoid TheoryMonoidsProving Set Identities
9
Computational complexity questions related to finite monoids and semigroups
Denis Thérien, Pascal Tesson · 2003 · 36 citations
Computing, Computer Science, Mathematics +15
The Equivalence Problem for Finite Rings
Stanley Burris, John Lawrence · Journal of Symbolic Computation · 1993 · 34 citations
Natural Sciences, Computer Science, Mathematics +10
The complexity of equivalence for commutative rings
Harry B. Hunt, Richard E. Stearns · Journal of Symbolic Computation · 1990 · 32 citations
Computing, Computer Science, Mathematics +12
The complexity of the equivalence problem for nonsolvable groups
Gábor Horváth, László Mérai, Csaba Szabó et al. · Bulletin of the London Mathematical Society · 2007 · 29 citations
Computing, Computer Science, Mathematics +17
THE COMPLEXITY OF CHECKING IDENTITIES OVER FINITE GROUPS
Gábor Horváth, Csaba Szabó · International Journal of Algebra and Computation · 2006 · 29 citations · Full text
Computing, Computer Science, Mathematics +11