The monotone circuit complexity of Boolean functions
Combinatorica
Journal of the ACM (JACM)
The complexity of Boolean functions
The complexity of Boolean functions
Monotone circuits for connectivity require super-logarithmic depth
STOC '88 Proceedings of the twentieth 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
Randomized versus nondeterministic communication complexity
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
The history and status of the P versus NP question
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Lower bounds for cutting planes proofs with small coefficients
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Nondeterministic communication with a limited number of advice bits
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
On relations between counting communication complexity classes
Journal of Computer and System Sciences
Limiting negations in bounded treewidth and upward planar circuits
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Monotone multilinear boolean circuits for bipartite perfect matching require exponential size
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
| Hi-index | 0.00 |