Nothing Special   »   [go: up one dir, main page]

×
Please click here if you are not redirected within a few seconds.
Leonard and Pellikaan developed the qth power algorithm to compute module bases for the integral closure of the polynomial ring F q [ x ] in a class of ...
Jul 23, 2008 · Abstract. Leonard and Pellikaan developed the qth power algorithm to compute module bases for the integral.
Jan 25, 2013 · Abstract:The Qth-power algorithm produces a useful canonical P-module presentation for the integral closures of certain integral extensions ...
Leonard and Pellikaan developed the qth power algorithm to compute module bases for the integral closure of the polynomial ring Fq[x] in a class of function ...
Abstract. The Qth-power algorithm produces a useful canonical P-module presentation for the integral closures of certain integral extensions of ...
Jan 25, 2013 · The Qth-power algorithm provides a useful canonical P-module presentation for the integral closures of certain integral extensions of P ...
On the qth power algorithm · Xiaochun Hu, Hiren Maharaj · Published in Finite Fields Their Appl. 1 November 2008 · Mathematics · Finite Fields Their Appl.
Mar 23, 2016 · PDF | The Qth-power algorithm produces a useful canonical P-module presentation for the integral closures of certain integral extensions.
This package computes the integral closure of type I affine domains and some slightly more general integral extensions of polynomial rings P using the qth-power ...
The Qth-power algorithm provides a useful canonical P P P -module presentation for the integral closures of certain integral extensions of P := F ​ [ x n , …