• DFT-based Word Normalization i...

Treffer: DFT-based Word Normalization in Finite Supersolvable Groups: DFT-based word normalization in finite supersolvable groups.

Title:
DFT-based Word Normalization in Finite Supersolvable Groups: DFT-based word normalization in finite supersolvable groups.
Authors:
Michael Clausen, Meinard Müller
Source:
Applicable Algebra in Engineering, Communication and Computing. 15:213-231
Publisher Information:
Springer Science and Business Media LLC, 2004.
Publication Year:
2004
Subject Terms:
Generators, relations, and presentations of groups, discrete Fourier transform, Finite solvable groups, theory of formations, Schunck classes, Fitting classes, \(\pi\)-length, ranks, Symbolic computation and algebraic computation, algorithms, fast polynomial divisions, word normalization, 01 natural sciences, finite supersolvable groups, normal forms, irreducible representations, 0101 mathematics, power-commutator presentations, Numerical methods for discrete and fast Fourier transforms, Computational methods (representations of groups)
Document Type:
Fachzeitschrift Article
File Description:
application/xml
Language:
English
ISSN:
1432-0622
0938-1279
DOI:
10.1007/s00200-004-0157-5
Access URL:
https://zbmath.org/2133262
https://doi.org/10.1007/s00200-004-0157-5
https://core.ac.uk/display/20909501
https://www.audiolabs-erlangen.de/content/05-fau/professor/00-mueller/03-publications/2004_MuellerClausen_WordNormalization_AAECC.pdf
https://link.springer.com/article/10.1007/s00200-004-0157-5
https://dblp.uni-trier.de/db/journals/aaecc/aaecc15.html#MullerC04
Rights:
Springer TDM
Accession Number:
edsair.doi.dedup.....3ada8f6a6c72a8b0bd56951d89dd4bf0
Database:
OpenAIRE

Weitere Informationen

zbMATH Open Web Interface contents unavailable due to conflicting licenses.