When do extra majority gates help?
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
On the computational power of depth 2 circuits with threshold and modulo gates
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
The Log-Rank conjecture and low degree polynomials
Information Processing Letters
Complexity classes of equivalence problems revisited
Information and Computation
Isolating an Odd Number of Elements and Applications in Complexity Theory
Theory of Computing Systems
| Hi-index | 0.00 |