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

researchr

You are not signed in
Sign in
Sign up

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]

This author has not been identified. Look up 'Mikael Goldmann' in GoogleThis author has not been identified. Look up 'Johan Håstad' in Google

runs on WebDSL