@inproceedings{17484c549d674fb39d3520047778c053,
title = "Monotone circuits for connectivity require super-logarithmic depth",
abstract = "We prove that every monotone circuit which tests st-connectivity of an undirected graph on n nodes has depth Ω(log2n). This implies a superpolynomial (nOmega;(logn) lower bound on the size of any monotone formula for st-connectivity.",
author = "Mauricio Karchmer and Avi Wigderson",
year = "1988",
doi = "10.1145/62212.62265",
language = "אנגלית",
isbn = "0897912640",
series = "Proceedings of the Annual ACM Symposium on Theory of Computing",
publisher = "Association for Computing Machinery",
pages = "539--550",
booktitle = "Proceedings of the 20th Annual ACM Symposium on Theory of Computing, STOC 1988",
note = "20th Annual ACM Symposium on Theory of Computing, STOC 1988 ; Conference date: 02-05-1988 Through 04-05-1988",
}