On the Complexity of Boolean Functions in Different Characteristics - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

Parikshit Gopalan, Shachar Lovett, Amir Shpilka. On the Complexity of Boolean Functions in Different Characteristics. In Proceedings of the 24th Annual IEEE Conference on Computational Complexity, CCC 2009, Paris, France, 15-18 July 2009. pages 173-183, IEEE Computer Society, 2009. [doi]

This author has not been identified. Look up 'Parikshit Gopalan' in GoogleThis author has not been identified. Look up 'Shachar Lovett' in GoogleThis author has not been identified. Look up 'Amir Shpilka' in Google

runs on WebDSL