Fast Multivariate Power Series Multiplication in Characteristic Zero
Let k be a field of characteristic zero. We present a fast algorithm formultiplying multivariate power series over k truncated in total degree. Upto logarithmic factors, its complexity is optimal, i.e. linear in the numberof coeffcients of the series.Keywords. Multivariate power series, fast multipl...
Guardado en:
| Autores principales: | , |
|---|---|
| Formato: | Articulo |
| Lenguaje: | Español |
| Publicado: |
2003
|
| Materias: | |
| Acceso en línea: | http://sedici.unlp.edu.ar/handle/10915/135308 https://publicaciones.sadio.org.ar/index.php/EJS/article/view/105 |
| Aporte de: |
| Sumario: | Let k be a field of characteristic zero. We present a fast algorithm formultiplying multivariate power series over k truncated in total degree. Upto logarithmic factors, its complexity is optimal, i.e. linear in the numberof coeffcients of the series.Keywords. Multivariate power series, fast multiplication, complexity. |
|---|