THE COMPLEXITY OF THE EQUIVALENCE PROBLEM OVER FINITE RINGS (Q3116848)

From MaRDI portal
scientific article
Language Label Description Also known as
English
THE COMPLEXITY OF THE EQUIVALENCE PROBLEM OVER FINITE RINGS
scientific article

    Statements

    THE COMPLEXITY OF THE EQUIVALENCE PROBLEM OVER FINITE RINGS (English)
    0 references
    0 references
    12 February 2012
    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