DFT-based word normalization in finite supersolvable groups. (Q1762552): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Computing Irreducible Representations of Supersolvable Groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4298259 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4502609 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4103728 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Collection from the left and other strategies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4285784 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4232492 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4227337 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Collection from the left / rank
 
Normal rank

Latest revision as of 18:08, 7 June 2024

scientific article
Language Label Description Also known as
English
DFT-based word normalization in finite supersolvable groups.
scientific article

    Statements

    DFT-based word normalization in finite supersolvable groups. (English)
    0 references
    0 references
    0 references
    9 February 2005
    0 references
    discrete Fourier transform
    0 references
    word normalization
    0 references
    power-commutator presentations
    0 references
    finite supersolvable groups
    0 references
    normal forms
    0 references
    irreducible representations
    0 references
    algorithms
    0 references
    fast polynomial divisions
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references