1400 search results - page 66 / 280 » On multiplication in finite fields |
SODA
1992
ACM
13 years 10 months ago
1992
ACM
In this paper we give the first self-testers and checkers for polynomials over rational and integer domains. We also show significantly stronger bounds on the efficiency of a simp...
DCG
2010
13 years 9 months ago
2010
Let V be a 3-dimensional vector space over a finite field. We show that any irreducible subgroup of GL(V ) that arises as the automorphism group of an regular polytope preserves a...
ECCC
2010
13 years 9 months ago
2010
We investigate the complexity of the following computational problem: Polynomial Entropy Approximation (PEA): Given a low-degree polynomial mapping p : Fn Fm , where F is a finite...
AAECC
2006
Springer
13 years 9 months ago
2006
Springer
We describe a complete algorithm to compute the hypergeometric solutions of linear recurrence relations with rational function coefficients. We use the notion of finite singularit...
FUIN
2008
13 years 8 months ago
2008
We give an algorithmic solution in a simple combinatorial data of Birkhoff s type problem studied in [14], for the category repft(I, K[t]/(tm)) of filtered I-chains of modules over...