| dc.creator | Lecerf, G. | |
| dc.creator | Schost, E. | |
| dc.date | 2003-06-26 | |
| dc.date | 2022-04-29T13:46:59Z | |
| dc.date.accessioned | 2023-07-15T06:25:33Z | |
| dc.date.available | 2023-07-15T06:25:33Z | |
| dc.identifier | http://sedici.unlp.edu.ar/handle/10915/135308 | |
| dc.identifier | https://publicaciones.sadio.org.ar/index.php/EJS/article/view/105 | |
| dc.identifier | issn:1514-6774 | |
| dc.identifier.uri | https://repositorioslatinoamericanos.uchile.cl/handle/2250/7476617 | |
| dc.description | 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. | |
| dc.description | Sociedad Argentina de Informática e Investigación Operativa | |
| dc.format | application/pdf | |
| dc.format | 1-10 | |
| dc.language | es | |
| dc.rights | http://creativecommons.org/licenses/by/4.0/ | |
| dc.rights | Creative Commons Attribution 4.0 International (CC BY 4.0) | |
| dc.subject | Ciencias Informáticas | |
| dc.subject | Multivariate power series | |
| dc.subject | fast multiplication | |
| dc.subject | complexity | |
| dc.title | Fast Multivariate Power Series Multiplication in Characteristic Zero | |
| dc.type | Articulo | |
| dc.type | Articulo | |
