121 search results - page 7 / 25 » Optimizing polynomials for floating-point implementation |
HPCS
2009
IEEE
15 years 1 months ago
2009
IEEE
We report efficient implementation techniques for FFT-based dense multivariate polynomial arithmetic over finite fields, targeting multi-cores. We have extended a preliminary study...
JSC
2008
14 years 9 months ago
2008
We describe the design, implementation and experimental evaluation of new algorithms for computing the approximate factorization of multivariate polynomials with complex coefficie...
APPROX
2008
Springer
14 years 11 months ago
2008
Springer
Abstract. In this paper, we propose a general framework for designing fully polynomial time approximation schemes for combinatorial optimization problems, in which more than one ob...
179
click to vote
EUROCRYPT
2011
Springer
14 years 1 months ago
2011
Springer
We describe a working implementation of a variant of Gentry’s fully homomorphic encryption scheme (STOC 2009), similar to the variant used in an earlier implementation effort b...
IPPS
2000
IEEE
15 years 2 months ago
2000
IEEE
We consider technology mapping from factored form binary leaf-DAG to lookup tables LUTs , such as those found in eld programmable gate arrays. Polynomial time algorithms exist f...