Probabilistic algorithms in finite fields
- 1 October 1981
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 02725428,p. 394-398
- https://doi.org/10.1109/sfcs.1981.37
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- An improvement of Rabin's probabilistic algorithm for generating irreducible polynomials over GF(p)Information Processing Letters, 1980
- Probabilistic Algorithms in Finite FieldsSIAM Journal on Computing, 1980
- Schnelle Multiplikation von Polynomen ber K rpern der Charakteristik 2Acta Informatica, 1977
- Factorizations of general polynomialsJournal of Number Theory, 1974
- Proof of a conjecture of S. ChowlaJournal of Number Theory, 1971
- Factoring Polynomials Over Large Finite FieldsMathematics of Computation, 1970
- Ordered cycle lengths in a random permutationTransactions of the American Mathematical Society, 1966