Lower Bounds for Testing Triangle-freeness in Boolean Functions

Arnab Bhattacharyya, Ning Xie. Lower Bounds for Testing Triangle-freeness in Boolean Functions. In Moses Charikar, editor, Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2010, Austin, Texas, USA, January 17-19, 2010. pages 87-98, SIAM, 2010. [doi]

@inproceedings{BhattacharyyaX10,
  title = {Lower Bounds for Testing Triangle-freeness in Boolean Functions},
  author = {Arnab Bhattacharyya and Ning Xie},
  year = {2010},
  url = {http://www.siam.org/proceedings/soda/2010/SODA10_009_bhattacharyyaa.pdf},
  tags = {testing},
  researchr = {https://researchr.org/publication/BhattacharyyaX10},
  cites = {0},
  citedby = {0},
  pages = {87-98},
  booktitle = {Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2010, Austin, Texas, USA, January 17-19, 2010},
  editor = {Moses Charikar},
  publisher = {SIAM},
}