Fast Multivariate Power Series Multiplication in Characteristic Zero

Autores
Lecerf, G.; Schost, E.
Año de publicación
2003
Idioma
español castellano
Tipo de recurso
artículo
Estado
versión publicada
Descripción
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.
Sociedad Argentina de Informática e Investigación Operativa
Materia
Ciencias Informáticas
Multivariate power series
fast multiplication
complexity
Nivel de accesibilidad
acceso abierto
Condiciones de uso
http://creativecommons.org/licenses/by/4.0/
Repositorio
SEDICI (UNLP)
Institución
Universidad Nacional de La Plata
OAI Identificador
oai:sedici.unlp.edu.ar:10915/135308
Acceder
id SEDICI_27860af50356d085778a2c6221b6da5b
oai_identifier_str oai:sedici.unlp.edu.ar:10915/135308
network_acronym_str SEDICI
repository_id_str 1329
network_name_str SEDICI (UNLP)
spelling Fast Multivariate Power Series Multiplication in Characteristic ZeroLecerf, G.Schost, E.Ciencias InformáticasMultivariate power seriesfast multiplicationcomplexityLet 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.Sociedad Argentina de Informática e Investigación Operativa2003-06-26info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionArticulohttp://purl.org/coar/resource_type/c_6501info:ar-repo/semantics/articuloapplication/pdf1-10http://sedici.unlp.edu.ar/handle/10915/135308spainfo:eu-repo/semantics/altIdentifier/url/https://publicaciones.sadio.org.ar/index.php/EJS/article/view/105info:eu-repo/semantics/altIdentifier/issn/1514-6774info:eu-repo/semantics/openAccesshttp://creativecommons.org/licenses/by/4.0/Creative Commons Attribution 4.0 International (CC BY 4.0)reponame:SEDICI (UNLP)instname:Universidad Nacional de La Platainstacron:UNLP2025-09-29T11:34:01Zoai:sedici.unlp.edu.ar:10915/135308Institucionalhttp://sedici.unlp.edu.ar/Universidad públicaNo correspondehttp://sedici.unlp.edu.ar/oai/snrdalira@sedici.unlp.edu.arArgentinaNo correspondeNo correspondeNo correspondeopendoar:13292025-09-29 11:34:01.704SEDICI (UNLP) - Universidad Nacional de La Platafalse
dc.title.none.fl_str_mv Fast Multivariate Power Series Multiplication in Characteristic Zero
title Fast Multivariate Power Series Multiplication in Characteristic Zero
spellingShingle Fast Multivariate Power Series Multiplication in Characteristic Zero
Lecerf, G.
Ciencias Informáticas
Multivariate power series
fast multiplication
complexity
title_short Fast Multivariate Power Series Multiplication in Characteristic Zero
title_full Fast Multivariate Power Series Multiplication in Characteristic Zero
title_fullStr Fast Multivariate Power Series Multiplication in Characteristic Zero
title_full_unstemmed Fast Multivariate Power Series Multiplication in Characteristic Zero
title_sort Fast Multivariate Power Series Multiplication in Characteristic Zero
dc.creator.none.fl_str_mv Lecerf, G.
Schost, E.
author Lecerf, G.
author_facet Lecerf, G.
Schost, E.
author_role author
author2 Schost, E.
author2_role author
dc.subject.none.fl_str_mv Ciencias Informáticas
Multivariate power series
fast multiplication
complexity
topic Ciencias Informáticas
Multivariate power series
fast multiplication
complexity
dc.description.none.fl_txt_mv 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.
Sociedad Argentina de Informática e Investigación Operativa
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.
publishDate 2003
dc.date.none.fl_str_mv 2003-06-26
dc.type.none.fl_str_mv info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
Articulo
http://purl.org/coar/resource_type/c_6501
info:ar-repo/semantics/articulo
format article
status_str publishedVersion
dc.identifier.none.fl_str_mv http://sedici.unlp.edu.ar/handle/10915/135308
url http://sedici.unlp.edu.ar/handle/10915/135308
dc.language.none.fl_str_mv spa
language spa
dc.relation.none.fl_str_mv info:eu-repo/semantics/altIdentifier/url/https://publicaciones.sadio.org.ar/index.php/EJS/article/view/105
info:eu-repo/semantics/altIdentifier/issn/1514-6774
dc.rights.none.fl_str_mv info:eu-repo/semantics/openAccess
http://creativecommons.org/licenses/by/4.0/
Creative Commons Attribution 4.0 International (CC BY 4.0)
eu_rights_str_mv openAccess
rights_invalid_str_mv http://creativecommons.org/licenses/by/4.0/
Creative Commons Attribution 4.0 International (CC BY 4.0)
dc.format.none.fl_str_mv application/pdf
1-10
dc.source.none.fl_str_mv reponame:SEDICI (UNLP)
instname:Universidad Nacional de La Plata
instacron:UNLP
reponame_str SEDICI (UNLP)
collection SEDICI (UNLP)
instname_str Universidad Nacional de La Plata
instacron_str UNLP
institution UNLP
repository.name.fl_str_mv SEDICI (UNLP) - Universidad Nacional de La Plata
repository.mail.fl_str_mv alira@sedici.unlp.edu.ar
_version_ 1844616220176809984
score 13.070432

Publicaciones similares