2000 character limit reached
The non-adaptive query complexity of testing k-parities (1209.3849v2)
Published 18 Sep 2012 in cs.CC and cs.DS
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.
Sponsor
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.