On the complexity of factoring bivariate supersparse (Lacunary) polynomials
Proceedings of the 2005 international symposium on Symbolic and algebraic computation
On the number of distinct elliptic curves in some families
Designs, Codes and Cryptography
GCD of many integers (extended abstract)
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
Randomized NP-completeness for p-adic rational roots of sparse polynomials in one variable
Proceedings of the 2010 International Symposium on Symbolic and Algebraic Computation
The multivariate resultant is NP-hard in any characteristic
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Quantum computing and polynomial equations over the finite field Z2
Quantum Information & Computation
Faster p-adic feasibility for certain multivariate sparse polynomials
Journal of Symbolic Computation
Algorithms for modular counting of roots of multivariate polynomials
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
Counting reducible and singular bivariate polynomials
Finite Fields and Their Applications
On the complexity of the multivariate resultant
Journal of Complexity
Sub-linear root detection, and new hardness results, for sparse polynomials over finite fields
Proceedings of the 38th international symposium on International symposium on symbolic and algebraic computation
Factoring bivariate lacunary polynomials without heights
Proceedings of the 38th international symposium on International symposium on symbolic and algebraic computation
| Hi-index | 0.00 |