An Explicit Lower Bound of 5n - o(n) for Boolean Circuits - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

Kazuo Iwama, Hiroki Morizumi. An Explicit Lower Bound of 5n - o(n) for Boolean Circuits. In Krzysztof Diks, Wojciech Rytter, editors, Mathematical Foundations of Computer Science 2002, 27th International Symposium, MFCS 2002, Warsaw, Poland, August 26-30, 2002, Proceedings. Volume 2420 of Lecture Notes in Computer Science, pages 353-364, Springer, 2002. [doi]

This author has not been identified. Look up 'Kazuo Iwama' in GoogleThis author has not been identified. Look up 'Hiroki Morizumi' in Google

runs on WebDSL