Matrix multiplication via arithmetic progressions
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Factoring polynomials and primitive elements for special primes
Theoretical Computer Science
Addition requirements for matrix and transposed matrix products
Journal of Algorithms
Solving systems of nonlinear polynomial equations faster
ISSAC '89 Proceedings of the ACM-SIGSAM 1989 international symposium on Symbolic and algebraic computation
On the deterministic complexity of factoring polynomials over finite fields
Information Processing Letters
Efficient computation of minimal polynomials in algebraic extensions of finite fields
ISSAC '99 Proceedings of the 1999 international symposium on Symbolic and algebraic computation
Tellegen's principle into practice
ISSAC '03 Proceedings of the 2003 international symposium on Symbolic and algebraic computation
Correcting Errors Beyond the Guruswami-Sudan Radius in Polynomial Time
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Change of order for bivariate triangular sets
Proceedings of the 2006 international symposium on Symbolic and algebraic computation
From coding theory to efficient pattern matching
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Chosen ciphertext attack on a new class of self-synchronizing stream ciphers
INDOCRYPT'04 Proceedings of the 5th international conference on Cryptology in India
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
Modular Composition Modulo Triangular Sets and Applications
Computational Complexity
| Hi-index | 0.00 |