Factoring high-degree polynomials by the black box Berlekamp algorithm
ISSAC '94 Proceedings of the international symposium on Symbolic and algebraic computation
Computing rational forms of integer matrices
Journal of Symbolic Computation
On Testing for Zero Polynomials by a Set of Points with Bounded Precision
COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
A Probabilistic Zero-Test for Expressions Involving Root of Rational Numbers
ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
On testing for zero polynomials by a set of points with bounded precision
Theoretical Computer Science - Computing and combinatorics
Shiftless decomposition and polynomial-time rational summation
ISSAC '03 Proceedings of the 2003 international symposium on Symbolic and algebraic computation
Factoring into coprimes in essentially linear time
Journal of Algorithms
Predicting subset sum pseudorandom generators
SAC'04 Proceedings of the 11th international conference on Selected Areas in Cryptography
Testing set proportionality and the Ádám isomorphism of circulant graphs
Journal of Discrete Algorithms
Hi-index | 0.01 |