Login / Signup
The complexity of class polynomial computation via floating point approximations
Andreas Enge
Published in:
CoRR (2006)
Keyphrases
</>
floating point
square root
fixed point
vapnik chervonenkis dimension
floating point arithmetic
efficient computation
instruction set
low order
polynomial hierarchy
constraint propagation
pairwise
fast fourier transform
polynomial size