Irreducibility of multivariate polynomials
Journal of Computer and System Sciences
Factoring sparse multivariate polynomials
Journal of Computer and System Sciences
Journal of Symbolic Computation - Special issue on computational algebraic complexity
The membership problem for unmixed polynomial ideals is solvable in single exponential time
Discrete Applied Mathematics - Special volume on applied algebra, algebraic algorithms, and error-correcting codes
Effective Noether irreducibility forms and applications
Selected papers of the 23rd annual ACM symposium on Theory of computing
Interpolation of sparse multivariate polynomials over large finite fields with applications
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Polynomial-Time Factorization of Multivariate Polynomials over Finite Fields
Proceedings of the 10th Colloquium on Automata, Languages and Programming
Solving systems of polynomial congruences modulo a large prime
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
A black box approach to the algebraic set decomposition problem
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
On the Computational Hardness of Testing Square-Freeness of Sparse Polynomials
AAECC-13 Proceedings of the 13th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
| Hi-index | 0.02 |