534 search results - page 3 / 107 » Efficient polynomial L-approximations |
ISSAC
1998
Springer
13 years 10 months ago
1998
Springer
Continuous changes of the coefficients of a polynomial move the roots continuously. We consider the problem finding the minimal perturbations to the coefficients to move a root to...
ACNS
2010
Springer
13 years 6 months ago
2010
Springer
In this work, we design two-party and multiparty protocols for evaluating multivariate polynomials at participants' inputs with security against a malicious adversary who may ...
APPT
2009
Springer
13 years 9 months ago
2009
Springer
We present the algorithm to multiply univariate polynomials with integer coefficients efficiently using the Number Theoretic transform (NTT) on Graphics Processing Units (GPU). The...
CA
1996
IEEE
13 years 10 months ago
1996
IEEE
We present efficient and accurate algorithms for interference detection among objects undergoing polynomial deformation. The scope of our algorithms include physically-based model...
ACMSE
2006
ACM
13 years 9 months ago
2006
ACM
We introduce an efficient way of performing polynomial multiplication in a class of finite fields GF(pm ) in the frequency domain. The Fast Fourier Transform (FFT) based frequency...