The monotone circuit complexity of Boolean functions
Combinatorica
Journal of the ACM (JACM)
On the distributional complexity of disjointness
Proceedings of the seventeenth international colloquium on Automata, languages and programming
A simple lower bound for monotone clique using a communication game
Information Processing Letters
Some complexity questions related to distributive computing(Preliminary Report)
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
Characterizing non-deterministic circuit size
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
More on the complexity of negation-limited circuits
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Extremal bipartite graphs and superpolynomial lower bounds for monotone span programs
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
A characterization of span program size and improved lower bounds for monotone span programs
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Two applications of information complexity
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
The Communication Complexity of the Universal Relation
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
A characterization of span program size and improved lower bounds for monotone span programs
Computational Complexity
On the complexity of communication complexity
Proceedings of the forty-first annual ACM symposium on Theory of computing
Lower bounds for lovász-schrijver systems and beyond follow from multiparty communication complexity
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Tight bounds for monotone switching networks via fourier analysis
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Clique problem, cutting plane proofs and communication complexity
Information Processing Letters
Exponential lower bounds and separation for query rewriting
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
Space-bounded communication complexity
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
Ontology-based data access with databases: a short course
RW'13 Proceedings of the 9th international conference on Reasoning Web: semantic technologies for intelligent data access
| Hi-index | 0.01 |
It is proven that monotone circuits computing the perfect matching function on n-vertex graphs require &OHgr;(n) depth. This implies an exponential gap between the depth of monotone and nonmonotone circuits.