Sciweavers

97 search results - page 7 / 20
» Finding roots of polynomials over finite fields
Sort
View
JCT
2011
85views more  JCT 2011»
13 years 2 months ago
Relatively prime polynomials and nonsingular Hankel matrices over finite fields
Mario García-Armas, Sudhir R. Ghorpade, Sam...
FFA
2010
159views more  FFA 2010»
13 years 4 months ago
Parity of the number of irreducible factors for composite polynomials
Various results on parity of the number of irreducible factors of given polynomials over finite fields have been obtained in the recent literature. Those are mainly based on Swan&...
Ryul Kim, Wolfram Koepf
STOC
1998
ACM
135views Algorithms» more  STOC 1998»
13 years 11 months ago
Checking Polynomial Identities over any Field: Towards a Derandomization?
We present a Monte Carlo algorithm for testing multivariate polynomial identities over any field using fewer random bits than other methods. To test if a polynomial P(x1 ::: xn) ...
Daniel Lewin, Salil P. Vadhan