Output-sensitive algorithms for sumset and sparse polynomial multiplication
type: Item
instance of: scholarly article
zbMATH Open document ID: 1346.68266
DOI: 10.1145/2755996.2756653
author: Andrew Arnold
author: Daniel S. Roche
published in: Proceedings of the 2015 ACM on International Symposium on Symbolic and Algebraic Computation
publication date: 2016-09-29T00:00:00Z
full work available at URL: https://arxiv.org/abs/1501.05296
Mathematics Subject Classification ID: 68W30
Mathematics Subject Classification ID: 11Y16
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68W20
zbMATH DE Number: 6631242
zbMATH Keywords: computational complexity
zbMATH Keywords: Minkowski sum
zbMATH Keywords: polynomial multiplication
zbMATH Keywords: sparse interpolation
zbMATH Keywords: sumset
MaRDI profile type: Publication
OpenAlex ID: W1969941659
arXiv ID: 1501.05296
title: Output-sensitive algorithms for sumset and sparse polynomial multiplication
description: scientific article; zbMATH DE number 6631242