The equivalence problem for finite rings
From MaRDI portal
Publication:2366112
DOI10.1006/jsco.1993.1004zbMath0779.16007OpenAlexW2006336761MaRDI QIDQ2366112
Publication date: 29 June 1993
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jsco.1993.1004
central idempotentsfinite ringsnilpotent ringsequivalence problemring termsco-\(NP\)-completeco-\(NP\)-hard
Analysis of algorithms and problem complexity (68Q25) Finite rings and finite-dimensional associative algebras (16P10) Nil and nilpotent radicals, sets, ideals, associative rings (16N40) Operations and polynomials in algebraic structures, primal algebras (08A40)
Related Items (22)
Loosely-abelian algebras ⋮ Complexity of the identity checking problem for finite semigroups. ⋮ Computers and universal algebra: Some directions ⋮ COMPLEXITY OF SEMIGROUP IDENTITY CHECKING ⋮ Complexity issues of checking identities in finite monoids ⋮ Satisfiability in MultiValued Circuits ⋮ Some applications of higher commutators in Mal'cev algebras ⋮ Equivalence and equation solvability problems for the alternating group \(\mathbf A_4\). ⋮ Identity checking problem for transformation monoids ⋮ The complexity of the equivalence and equation solvability problems over nilpotent rings and groups. ⋮ The complexity of the equation solvability problem over semipattern groups ⋮ THE EQUIVALENCE PROBLEM OVER FINITE RINGS ⋮ Word problem of the Perkins semigroup via directed acyclic graphs. ⋮ An assertion concerning functionally complete algebras and NP-completeness ⋮ Unnamed Item ⋮ The equation solvability problem over supernilpotent algebras with Mal’cev term ⋮ THE PERKINS SEMIGROUP HAS CO-NP-COMPLETE TERM-EQUIVALENCE PROBLEM ⋮ Evaluation of polynomials over finite rings via additive combinatorics ⋮ THE COMPLEXITY OF THE EQUIVALENCE PROBLEM OVER FINITE RINGS ⋮ THE COMPLEXITY OF CHECKING IDENTITIES OVER FINITE GROUPS ⋮ The complexity of the equivalence and equation solvability problems over meta-abelian groups ⋮ Algebra complexity problems involving graph homomorphism, semigroups and the constraint satisfaction problem
This page was built for publication: The equivalence problem for finite rings
