Circuit and decision tree complexity of some number theoretic problems
Information and Computation
On Polynomial Representations of Boolean Functions Related to Some Number Theoretic Problems
FST TCS '01 Proceedings of the 21st Conference on Foundations of Software Technology and Theoretical Computer Science
Complexity of some arithmetic problems for binary polynomials
Computational Complexity
On the Optimality of the Binary Algorithm for the Jacobi Symbol
Fundamenta Informaticae
On the Optimality of the Binary Algorithm for the Jacobi Symbol
Fundamenta Informaticae
| Hi-index | 0.01 |