73 search results - page 7 / 15 » Permutations, hyperplanes and polynomials over finite fields |
105
click to vote
JCT
2008
15 years 4 months ago
2008
A three-dimensional analogue of the classical direction problem is proposed and an asymptotically sharp bound for the number of directions determined by a nonplanar set in AG(3, p)...
161
click to vote
MOC
1998
15 years 3 months ago
1998
Abstract. This paper shows that there is a close relationship between the Euclidean algorithm for polynomials and the Lanczos method for solving sparse linear systems, especially w...
136
click to vote
FOCM
2008
15 years 4 months ago
2008
Let Fq be the finite field of q elements, where q = ph. Let f(x) be a polynomial over Fq in n variables with m non-zero terms. Let N(f) denote the number of solutions of f(x) = 0 ...
123
click to vote
ISSAC
2009
Springer
15 years 10 months ago
2009
Springer
An Artin-Schreier tower over the finite field Fp is a tower of field extensions generated by polynomials of the form Xp − X − α. Following Cantor and Couveignes, we give a...
153
click to vote
AAECC
1997
Springer
15 years 8 months ago
1997
Springer
We describe the Maple [23] implementation of multivariate factorization over general finite fields. Our first implementation is available in Maple V Release 3. We give selected det...