Monotone circuits for connectivity have depth (log n):::2-o(1)::: (Extended Abstract)

Mikael Goldmann, Johan HÃ¥stad. Monotone circuits for connectivity have depth (log n):::2-o(1)::: (Extended Abstract). In Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing, 29 May-1 June 1995, Las Vegas, Nevada, USA. pages 569-574, ACM, 1995. [doi]

Abstract

Abstract is missing.