2766 search results - page 73 / 554 » Algorithms for trigonometric polynomials |
118
Voted
ANTS
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. For K3 surfaces, we derive some conditions the characteristic polynomial of the Frobenius on the ´etale cohomology must satisfy. These conditions may be used to speed up...
111
Voted
CSR
2006
Springer
15 years 4 months ago
2006
Springer
Let Mq (n ) denote the number of multiplications required to compute the coefficients of the product of two polynomials of degree n over a q -element field by means of bilinear alg...
72
Voted
AAECC
1995
Springer
15 years 4 months ago
1995
Springer
In [ASTW] it was given a Grobner reduction based division formula for entire functions by polynomial ideals. Here we give degree bounds where the input function can be truncated i...
93
Voted
CORR
2008
Springer
15 years 25 days ago
2008
Springer
This paper describes and analyzes a method for computing border bases of a zero-dimensional ideal I. The criterion used in the computation involves specific commutation polynomial...
96
Voted
AAECC
2002
Springer
15 years 19 days ago
2002
Springer
Let Fq be the finite field of order q and be an element of Fq of order d. The construction of an explicit polynomial f (X) Fq[X] of degree d - 1 with the property f i = i2 for ...