Monte-Carlo approximation algorithms for enumeration problems
Journal of Algorithms
An approximation algorithm for the number of zeros of arbitrary polynomials over GF[q]
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
On computing sparse shifts for univariate polynomials
ISSAC '94 Proceedings of the international symposium on Symbolic and algebraic computation
Algorithms for computing sparse shifts for multivariate polynomials
ISSAC '95 Proceedings of the 1995 international symposium on Symbolic and algebraic computation
Fast Probabilistic Algorithms for Verification of Polynomial Identities
Journal of the ACM (JACM)
A Zero-Test and an Interpolation Algorithm for the Shifted Sparse Polynominals
AAECC-10 Proceedings of the 10th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Quantum Cryptanalysis of Hidden Linear Functions (Extended Abstract)
CRYPTO '95 Proceedings of the 15th Annual International Cryptology Conference on Advances in Cryptology
Quantum algorithms for solvable groups
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
| Hi-index | 0.00 |