On the hardness of computing the permanent of random matrices (extended abstract)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Chinese remaindering with errors
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Optimal series-parallel trade-offs for reducing a function to its own graph
Information and Computation
Some connections between bounded query classes and non-uniform complexity
Information and Computation
The enumerability of P collapses P to NC
Theoretical Computer Science - Mathematical foundations of computer science 2004
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
| Hi-index | 0.89 |