Information transfer under different sets of protocols
SIAM Journal on Computing
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
Multiparty protocols and logspace-hard pseudorandom sequences
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Representing Boolean functions as polynomials modulo composite numbers
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Las Vegas is better than determinism in VLSI and distributed computing (Extended Abstract)
STOC '82 Proceedings of the fourteenth 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
Upper and Lower Bounds for Some Depth-3 Circuit Classes
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
The correlation between parity and quadratic polynomials mod 3
Journal of Computer and System Sciences - Special issue on computational complexity 2002
Depth Reduction for Circuits with a Single Layer of Modular Counting Gates
CSR '09 Proceedings of the Fourth International Computer Science Symposium in Russia on Computer Science - Theory and Applications
On the correlation between parity and modular polynomials
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
| Hi-index | 0.00 |