Sciweavers

1296 search results - page 28 / 260
» The Number Field Sieve
Sort
View
FFA
2006
120views more  FFA 2006»
13 years 10 months ago
Enumerating permutation polynomials over finite fields by degree II
This note is a continuation of a paper by the same authors that appeared in 2002 in the same journal. First we extend the method of the previous paper proving an asymptotic formul...
Sergei Konyagin, Francesco Pappalardi
FFA
2010
84views more  FFA 2010»
13 years 8 months ago
Generating series for irreducible polynomials over finite fields
We count the number of irreducible polynomials in several variables of a given degree over a finite field. The results are expressed in terms of a generating series, an exact for...
Arnaud Bodin
FFA
2011
104views more  FFA 2011»
13 years 4 months ago
Zeta functions of equivalence relations over finite fields
ABSTRACT. We prove the rationality of the generating function associated to the number of equivalence classes of Fqk -points of a constructible equivalence relation defined over t...
Tibor Beke
PC
2002
114views Management» more  PC 2002»
13 years 9 months ago
Optimizing noncontiguous accesses in MPI-IO
The I/O access patterns of many parallel applications consist of accesses to a large number of small, noncontiguous pieces of data. If an application's I/O needs are met by m...
Rajeev Thakur, William Gropp, Ewing L. Lusk
PRIS
2003
13 years 11 months ago
Numerical Field Extraction in Handwritten Incoming Mail Documents
In this communication, we propose a method for the automatic extraction of numerical fields in handwritten documents. The approach exploits the known syntactic structure of the num...
Guillaume Koch, Laurent Heutte, Thierry Paquet