Separating the polynomial-time hierarchy by oracles
Proc. 26th annual symposium on Foundations of computer science
Almost optimal lower bounds for small depth circuits
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
The monotone circuit complexity of Boolean functions
Combinatorica
Combinatorica
Some complexity questions related to distributive computing(Preliminary Report)
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
On monotone formulae with restricted depth
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Circuits and local computation
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Tradeoffs between communication and space
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Monotone circuits for matching require linear depth
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Rounds in communication complexity revisited
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Resiliency of interactive distributed tasks (extended abstracts)
PODC '91 Proceedings of the tenth annual ACM symposium on Principles of distributed 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 union-split-find related problems on random access machines
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Symmetric logspace is closed under complement
STOC '95 Proceedings of the twenty-seventh 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
Optimal bounds for the predecessor problem
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Optimal bounds for the predecessor problem and related problems
Journal of Computer and System Sciences - STOC 1999
Randomized Communication Protocols (A Survey)
SAGA '01 Proceedings of the International Symposium on Stochastic Algorithms: Foundations and Applications
Exponential communication inefficiency of demand queries
TARK '05 Proceedings of the 10th conference on Theoretical aspects of rationality and knowledge
Combinatorics, Probability and Computing
Negative weights make adversaries stronger
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
On the complexity of communication complexity
Proceedings of the forty-first annual ACM symposium on Theory of computing
Partition Arguments in Multiparty Communication Complexity
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
A new rank technique for formula size lower bounds
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
Limiting negations in bounded treewidth and upward planar circuits
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Tight bounds for Lp samplers, finding duplicates in streams, and related problems
Proceedings of the thirtieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
An optimal lower bound on the communication complexity of gap-hamming-distance
Proceedings of the forty-third annual ACM symposium on Theory of computing
Incremental branching programs
CSR'06 Proceedings of the First international computer science conference on Theory and Applications
Lower bounds using kolmogorov complexity
CiE'06 Proceedings of the Second conference on Computability in Europe: logical Approaches to Computational Barriers
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
Monotone circuits for the majority function
APPROX'06/RANDOM'06 Proceedings of the 9th international conference on Approximation Algorithms for Combinatorial Optimization Problems, and 10th international conference on Randomization and Computation
Theoretical Computer Science
Space-bounded communication complexity
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
Letting Alice and Bob choose which problem to solve: Implications to the study of cellular automata
Theoretical Computer Science
Optimal Collapsing Protocol for Multiparty Pointer Jumping
Theory of Computing Systems
| Hi-index | 0.00 |
We prove that every monotone circuit which tests st-connectivity of an undirected graph on n nodes has depth &OHgr;(log2n). This implies a superpolynomial (n&OHgr;(log n)) lower bound on the size of any monotone formula for st-connectivity.The proof draws intuition from a new characterization of circuit depth in terms of communication complexity. It uses counting arguments and Extremal Set Theory.Within the same framework, we also give a very simple and intuitive proof of a depth analogue of a theorem of Krapchenko concerning formula size lower bounds.