Fast polynomial factorization and modular composition in small characteristic
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
On the relation between polynomial identity testing and finding variable disjoint factors
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Arithmetic Circuits: A survey of recent results and open questions
Foundations and Trends® in Theoretical Computer Science
Fast Polynomial Factorization and Modular Composition
SIAM Journal on Computing
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
Hi-index | 0.02 |