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...
Autor principal: | Jaroschek, Maximilian |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Elsevier Limited
2013
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4599632/ https://www.ncbi.nlm.nih.gov/pubmed/26523087 http://dx.doi.org/10.1016/j.jsc.2013.05.012 |
Ejemplares similares
-
Polynomials and polynomial inequalities
por: Borwein, Peter, et al.
Publicado: (1995) -
The Trigonometric Polynomial Like Bernstein Polynomial
por: Han, Xuli
Publicado: (2014) -
Polynomial and horizontally polynomial functions on Lie groups
por: Antonelli, Gioacchino, et al.
Publicado: (2022) -
Polynomials
por: Prasolov, Victor V
Publicado: (2010) -
Orthogonal polynomials
por: Szegő, G
Publicado: (1939)