The complexity of class polynomial computation via floating point approximations.

Published in: Math. Comput. (2009)

Keyphrases

floating point
square root
vapnik chervonenkis dimension
fixed point
floating point arithmetic
efficient computation
fast fourier transform
low order
polynomial size
polynomial hierarchy
sparse matrices
frequency domain
general purpose
parallel computation