On the bit-complexity of sparse polynomial multiplication

Joris van der Hoeven Grégoire Lecerf

Published in: CoRR (2009)

Keyphrases

computational complexity
vapnik chervonenkis dimension
high dimensional
computational cost
sparse representation
signal processing
polynomial hierarchy
sparse data
bayesian networks
feature space
space complexity
arithmetic operations
polynomial size
exponential size
integer arithmetic