Back to Search
Start Over
On the qth power algorithm
- Source :
-
Finite Fields & Their Applications . Nov2008, Vol. 14 Issue 4, p1068-1082. 15p. - Publication Year :
- 2008
-
Abstract
- Abstract: Leonard and Pellikaan developed the qth power algorithm to compute module bases for the integral closure of the polynomial ring in a class of function fields. In this paper, their algorithm is adapted to efficiently obtain an -basis for a class of Riemann–Roch spaces without having to compute the entire integral closure. This reformulation allows one to determine the complexity of the algorithm. Further, we obtain a simple characterization of the integral closure. [Copyright &y& Elsevier]
- Subjects :
- *ALGORITHMS
*ALGEBRA
*FOUNDATIONS of arithmetic
*POLYNOMIAL rings
Subjects
Details
- Language :
- English
- ISSN :
- 10715797
- Volume :
- 14
- Issue :
- 4
- Database :
- Academic Search Index
- Journal :
- Finite Fields & Their Applications
- Publication Type :
- Academic Journal
- Accession number :
- 34870064
- Full Text :
- https://doi.org/10.1016/j.ffa.2008.06.005