73 search results - page 6 / 15 » Decidability of Sub-theories of Polynomials over a Finite Fi... |
122
click to vote
DLT
2009
14 years 11 months ago
2009
Blanchet-Sadri et al. have shown that Avoidability, or the problem of deciding the avoidability of a finite set of partial words over an alphabet of size k 2, is NP-hard [Theoret...
140
click to vote
MOC
1998
15 years 1 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...
111
click to vote
FOCM
2008
15 years 1 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 ...
101
Voted
ISSAC
2009
Springer
15 years 8 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...
130
Voted
AAECC
1997
Springer
15 years 6 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...