Zobrazeno 1 - 4
of 4
pro vyhledávání: '"reduction polynomial"'
Autor:
M. Repka
Publikováno v:
Electronics Letters, Vol 52, Iss 9, Pp 718-719 (2016)
Direct computation of pth roots in extended finite fields of characteristic p ≥ 2 is introduced, wherein the reduction polynomial is irreducible and can be even random. Proposed method works in any case of p ≥ 2 and finite field extension. This m
Externí odkaz:
https://doaj.org/article/7f644cc43b5941dabee9a20fdbc4e21c
Autor:
Apel, Joachim
In [ASTW] it was given a Gröbner reduction based division formula for entire functions by polynomial ideals. Here we give degree bounds where the input function can be truncated in order to compute approximations of the coeffcients of the power seri
Externí odkaz:
https://ul.qucosa.de/id/qucosa%3A31854
https://ul.qucosa.de/api/qucosa%3A31854/attachment/ATT-0/
https://ul.qucosa.de/api/qucosa%3A31854/attachment/ATT-0/
Autor:
Joachim Apel
Publikováno v:
Applied Algebra, Algebraic Algorithms and Error-Correcting Codes ISBN: 9783540601142
AAECC
AAECC
In [ASTW] it was given a Grobner reduction based division formula for entire functions by polynomial ideals. Here we give degree bounds where the input function can be truncated in order to compute approximations of the coefficients of the power seri
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::66e9b2f22b65a42de07f697681469401
https://doi.org/10.1007/3-540-60114-7_6
https://doi.org/10.1007/3-540-60114-7_6
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.