Property Testing Bounds for Linear and Quadratic Functions via Parity Decision Trees

@article{Bhrushundi2013PropertyTB,
title={Property Testing Bounds for Linear and Quadratic Functions via Parity Decision Trees},
author={Abhishek Bhrushundi and Sourav Chakraborty and Raghav Kulkarni},
journal={Electronic Colloquium on Computational Complexity (ECCC)},
year={2013},
volume={20},
pages={142}
}

In this paper , we study linear and quadratic Boolean functions in the context of property testing. We do this by observing that the query complexity of testing properties of linear and quadratic functions can be characterized in terms of the complexity in another model of computation called parity decision trees. The observation allows us to characterize the testable properties of linear functions in terms of the approximate l1 norm of the Fourier spectrum of an associated function. It also… CONTINUE READING