Separating the polynomial-time hierarchy by oracles
Proc. 26th annual symposium on Foundations of computer science
Bounded-width polynomial-size branching programs recognize exactly those languages in NC1
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Almost optimal lower bounds for small depth circuits
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Algebraic methods in the theory of lower bounds for Boolean circuit complexity
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
The complexity of Boolean functions
The complexity of Boolean functions
Lower bounds for synchronous circuits and planar circuits
Information Processing Letters
Multiparty protocols and logspace-hard pseudorandom sequences
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Some complexity questions related to distributive computing(Preliminary Report)
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
Functional Inversion and Communication Complexity
CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
| Hi-index | 0.00 |