63 search results - page 2 / 13 » Efficient Computation of Roots in Finite Fields |
AAECC
1997
Springer
13 years 9 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...
CORR
2008
Springer
13 years 5 months ago
2008
Springer
Abstract. In this paper we develop a general technique to eliminate the assumption of the Generalized Riemann Hypothesis (GRH) from various deterministic polynomial factoring algor...
ACMSE
2006
ACM
13 years 9 months ago
2006
ACM
We introduce an efficient way of performing polynomial multiplication in a class of finite fields GF(pm ) in the frequency domain. The Fast Fourier Transform (FFT) based frequency...
WSC
2008
13 years 7 months ago
2008
We are interested in computing tail probabilities for the maxima of Gaussian random fields. In this paper, we discuss two special cases: random fields defined over a finite number...
VIS
2007
IEEE
14 years 6 months ago
2007
IEEE
This paper presents a method for filtered ridge extraction based on adaptive mesh refinement. It is applicable in situations where the underlying scalar field can be refined during...