Riemann hypothesis and finding roots over finite fields
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Minkowski's convex body theorem and integer programming
Mathematics of Operations Research
On principal ideal testing in algebraic number fields
Journal of Symbolic Computation
Factoring polynomials and primitive elements for special primes
Theoretical Computer Science
Factoring polynomials over finite fields
Journal of Algorithms
Searching for primitive roots in finite fields
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Removing randomness from computational number theory
Removing randomness from computational number theory
Models of Computation, Riemann Hypothesis, and Classical Mathematics
SOFSEM '98 Proceedings of the 25th Conference on Current Trends in Theory and Practice of Informatics: Theory and Practice of Informatics
On the bit-complexity of sparse polynomial and series multiplication
Journal of Symbolic Computation
| Hi-index | 0.00 |