Idempotent computation over finite fields

DOI10.1006/JSCO.1994.1015zbMath0820.11074OpenAlexW2149814052MaRDI QIDQ1333163

Richard A. Davis

Publication date: 13 September 1994

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jsco.1994.1015

zbMATH Keywords

finite fieldprimitive idempotentsbasic algorithmcommutative artinian algebrasfactorization of univariate polynomialsgroup algebra of a finite abelian group of odd order

Mathematics Subject Classification ID

Number-theoretic algorithms; complexity (11Y16) Structure theory for finite fields and commutative rings (number-theoretic aspects) (11T30) Computational aspects of associative rings (general theory) (16Z05) Arithmetic theory of polynomial rings over finite fields (11T55) Artinian rings and modules (associative rings and algebras) (16P20)

Related Items (1)

Factoring polynomials over finite fields: A survey

This page was built for publication: Idempotent computation over finite fields