Algebraic Methods in the Theory of Lower Bounds for Boolean Circuit Complexity

Roman Smolensky. Algebraic Methods in the Theory of Lower Bounds for Boolean Circuit Complexity. In Proceedings of the Nineteenth Annual ACM Symposium on Theory of Computing, 25-27 May 1987, New York City, NY, USA. pages 77-82, ACM, 1987.

Authors

Roman Smolensky

This author has not been identified. Look up 'Roman Smolensky' in Google