Functional decomposition ofpolynomials: the tame case
Journal of Symbolic Computation - Special issue on computational algebraic complexity
Uniform constant-depth threshold circuits for division and iterated multiplication
Journal of Computer and System Sciences - Complexity 2001
The enumerability of P collapses P to NC
Theoretical Computer Science - Mathematical foundations of computer science 2004
Finding a vector orthogonal to roughly half a collection of vectors
Journal of Complexity
Randomness and completeness in computational complexity
Randomness and completeness in computational complexity
On the complexity of powering in finite fields
Proceedings of the forty-third annual ACM symposium on Theory of computing
Constant-Depth circuits for arithmetic in finite fields of characteristic two
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Hi-index | 0.00 |