Calculating the set of orders of elements in the finite linear groups (Q3545834): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: The Complete Analysis of a Polynomial Factorization Algorithm over Finite Fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4336113 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4023676 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3851217 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2724055 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic Algorithms in Finite Fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characteristic property ofA 8 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the deterministic complexity of factoring polynomials over finite fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast construction of irreducible polynomials over finite fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new polynomial factorization algorithm and its implementation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3137899 / rank
 
Normal rank

Latest revision as of 22:39, 28 June 2024

scientific article
Language Label Description Also known as
English
Calculating the set of orders of elements in the finite linear groups
scientific article

    Statements

    Calculating the set of orders of elements in the finite linear groups (English)
    0 references
    0 references
    11 December 2008
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    general linear groups
    0 references
    special linear groups
    0 references
    element orders
    0 references
    finite fields
    0 references
    algorithms
    0 references
    0 references