Depth reduction for noncommutative arithmetic circuits
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Uniform constant-depth threshold circuits for division and iterated multiplication
Journal of Computer and System Sciences - Complexity 2001
Computational complexity of neural networks: a survey
Nordic Journal of Computing
The Dynamic Complexity of Transitive Closure Is In DynTC0
ICDT '01 Proceedings of the 8th International Conference on Database Theory
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
The dynamic complexity of transitive closure is in DynTC0
Theoretical Computer Science - Database theory
On TC/sup 0/, AC/sup 0/, and Arithmetic Circuits
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
Number-theoretic constructions of efficient pseudo-random functions
Journal of the ACM (JACM)
On defining integers in the counting hierarchy and proving arithmetic circuit lower bounds
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
Algorithms and theory of computation handbook
The complexity of game isomorphism
Theoretical Computer Science
Green's theorem and isolation in planar graphs
Information and Computation
Pseudorandom functions and lattices
EUROCRYPT'12 Proceedings of the 31st Annual international conference on Theory and Applications of Cryptographic Techniques
On the Sum of Square Roots of Polynomials and Related Problems
ACM Transactions on Computation Theory (TOCT)
Root finding with threshold circuits
Theoretical Computer Science
Rational arguments: single round delegation with sublinear verification
Proceedings of the 5th conference on Innovations in theoretical computer science
| Hi-index | 0.00 |