Sciweavers

2766 search results - page 12 / 554
» Algorithms for trigonometric polynomials
Sort
View
CMA
2010
183views more  CMA 2010»
13 years 5 months ago
Ramanujan's class invariants and their use in elliptic curve cryptography
Complex Multiplication (CM) method is a frequently used method for the generation of elliptic curves (ECs) over a prime field Fp. The most demanding and complex step of this metho...
Elisavet Konstantinou, Aristides Kontogeorgis
ADG
2006
Springer
204views Mathematics» more  ADG 2006»
14 years 2 months ago
Algorithmic Search for Flexibility Using Resultants of Polynomial Systems
This paper describes the recent convergence of four topics: polynomial systems, flexibility of three dimensional objects, computational chemistry, and computer algebra. We discuss...
Robert H. Lewis, Evangelos A. Coutsias
ESA
2000
Springer
84views Algorithms» more  ESA 2000»
14 years 2 days ago
On Representations of Algebraic-Geometric Codes for List Decoding
Abstract. We show that all algebraic-geometric codes possess a succinct representation that allows for the list decoding algorithms of [15, 7] to run in polynomial time. We do this...
Venkatesan Guruswami, Madhu Sudan
CORR
2008
Springer
131views Education» more  CORR 2008»
13 years 8 months ago
Optimizing polynomials for floating-point implementation
The floating-point implementation of a function often reduces to a polynomial approximation on an interval. Remez algorithm provides the polynomial closest to the function, but th...
Florent de Dinechin, Christoph Quirin Lauter