Computing Frobenius maps and factoring polynomials
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Protecting Mobile Agents Against Malicious Hosts
Mobile Agents and Security
The enumerability of P collapses P to NC
Theoretical Computer Science - Mathematical foundations of computer science 2004
On the Optimality of the Binary Algorithm for the Jacobi Symbol
Fundamenta Informaticae
Arithmetizing classes around NC1and L
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
Counting classes and the fine structure between NC1and L
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Counting classes and the fine structure between NC1 and L
Theoretical Computer Science
Binary Representations of Finite Fields and Their Application to Complexity Theory
Finite Fields and Their Applications
On the Optimality of the Binary Algorithm for the Jacobi Symbol
Fundamenta Informaticae
Hi-index | 0.00 |