On the Complexity of Boolean functions in different charactersistics - Microsoft Research

Microsoft Translator |

On the Complexity of Boolean functions in different charactersistics

Parikshit Gopalan, Shachar Lovett, and Amir Shpilka
July 2009

In CCC'09

Details

Type	Inproceedings

Related People

Parikshit Gopalan

Share

> Publications > On the Complexity of Boolean functions in different charactersistics