Fast parallel absolute irreducibility testing
Journal of Symbolic Computation
Almost all primes can be quickly certified
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Recognizing primes in random polynomial time
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Deterministic irreducibility testing of polynomials over large finite fields
Journal of Symbolic Computation
When does a polynomial over a finite field permute the elements of the fields?
American Mathematical Monthly
Tests for permutation polynomials
SIAM Journal on Computing
On fast multiplication of polynomials over arbitrary algebras
Acta Informatica
Counting curves and their projections
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
A deterministic test for permutation polynomials
Computational Complexity
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Factorization of Polynomials over Finite Fields in Subexponential Time under GRH
Factorization of Polynomials over Finite Fields in Subexponential Time under GRH
Tests for Permutation Functions
Finite Fields and Their Applications
Permutation Polynomials Modulo 2w
Finite Fields and Their Applications
| Hi-index | 0.00 |