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
On the Optimality of the Binary Algorithm for the Jacobi Symbol
Fundamenta Informaticae
ACM Transactions on Computational Logic (TOCL)
Lower bounds for decision problems in imaginary, norm-Euclidean quadratic integer rings
Journal of Symbolic Computation
On the Optimality of the Binary Algorithm for the Jacobi Symbol
Fundamenta Informaticae
| Hi-index | 0.00 |