On the Complexity of Boolean Functions in Different Characteristics

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]

@inproceedings{GopalanLS09,
  title = {On the Complexity of Boolean Functions in Different Characteristics},
  author = {Parikshit Gopalan and Shachar Lovett and Amir Shpilka},
  year = {2009},
  doi = {10.1109/CCC.2009.14},
  url = {http://doi.ieeecomputersociety.org/10.1109/CCC.2009.14},
  researchr = {https://researchr.org/publication/GopalanLS09},
  cites = {0},
  citedby = {0},
  pages = {173-183},
  booktitle = {Proceedings of the 24th Annual IEEE Conference on Computational Complexity, CCC 2009, Paris, France, 15-18 July 2009},
  publisher = {IEEE Computer Society},
  isbn = {978-0-7695-3717-7},
}