Cargando...
Improved polynomial remainder sequences for Ore polynomials()
Polynomial remainder sequences contain the intermediate results of the Euclidean algorithm when applied to (non-)commutative polynomials. The running time of the algorithm is dependent on the size of the coefficients of the remainders. Different ways have been studied to make these as small as possi...
Gardado en:
| Publicado en: | J Symb Comput |
|---|---|
| Autor Principal: | |
| Formato: | Artigo |
| Idioma: | Inglês |
| Publicado: |
Elsevier Limited
2013
|
| Assuntos: | |
| Acceso en liña: | https://ncbi.nlm.nih.gov/pmc/articles/PMC4599632/ https://ncbi.nlm.nih.gov/pubmed/26523087 https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1016/j.jsc.2013.05.012 |
| Tags: |
Engadir etiqueta
Sen Etiquetas, Sexa o primeiro en etiquetar este rexistro!
|