The complexity of the equivalence and equation solvability problems over nilpotent rings and groups. (Q652516): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2002247104 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of the identity checking problem for finite semigroups. / rank
 
Normal rank
Property / cites work
 
Property / cites work: The equivalence problem for finite rings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Results on the equivalence problem for finite groups. / rank
 
Normal rank
Property / cites work
 
Property / cites work: THE COMPLEXITY OF THE EQUIVALENCE PROBLEM OVER FINITE RINGS / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of the equivalence problem for nonsolvable groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: THE COMPLEXITY OF CHECKING IDENTITIES OVER FINITE GROUPS / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of equivalence for commutative rings / rank
 
Normal rank
Property / cites work
 
Property / cites work: COMPLEXITY OF SEMIGROUP IDENTITY CHECKING / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity issues of checking identities in finite monoids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4708591 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Varieties of groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3779765 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3617672 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational complexity of checking identities in 0-simple semigroups and matrix semigroups over finite fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of checking identities for finite matrix rings / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of the word-problem for finite matrix rings / rank
 
Normal rank
Property / cites work
 
Property / cites work: THE EQUIVALENCE PROBLEM OVER FINITE RINGS / rank
 
Normal rank

Latest revision as of 18:32, 4 July 2024

scientific article
Language Label Description Also known as
English
The complexity of the equivalence and equation solvability problems over nilpotent rings and groups.
scientific article

    Statements

    The complexity of the equivalence and equation solvability problems over nilpotent rings and groups. (English)
    0 references
    0 references
    14 December 2011
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    finite rings
    0 references
    computational complexity
    0 references
    equivalence problem
    0 references
    ring terms
    0 references
    equation solvability problems
    0 references
    finite nilpotent groups
    0 references
    0 references