On the bit-complexity of sparse polynomial and series multiplication.

Joris van der Hoeven Grégoire Lecerf

Published in: J. Symb. Comput. (2013)

Keyphrases

polynomial hierarchy
vapnik chervonenkis dimension
sparse data
neural network
sparse sampling
worst case
memory requirements
floating point
arithmetic operations
randomized approximation
real time
integer arithmetic
polynomial size
high order
upper bound
data structure
data sets