The non-adaptive query complexity of testing k-parities
Computational Complexity
2013-07-04 v2 Data Structures and Algorithms
Abstract
We prove tight bounds of Theta(k log k) queries for non-adaptively testing whether a function f:{0,1}^n -> {0,1} is a k-parity or far from any k-parity. The lower bound combines a recent method of Blais, Brody and Matulef [BBM11] to get lower bounds for testing from communication complexity with an Omega(k \log k) lower bound for the one-way communication complexity of k-disjointness.
Cite
@article{arxiv.1209.3849,
title = {The non-adaptive query complexity of testing k-parities},
author = {Harry Buhrman and David Garcia-Soriano and Arie Matsliah and Ronald de Wolf},
journal= {arXiv preprint arXiv:1209.3849},
year = {2013}
}