Lower Bounds on Testing Functions of Low Fourier Degree

Details Lower Bounds on Testing Functions of Low Fourier Degree Lower Bounds on Testing Functions of Low Fourier Degree

2012-02-16

arxiv.org/abs/1202.3479v3

Computer Science

Computational Complexity

12 pages, no figures

Scientific paper

We consider the problem of testing whether a Boolean function has Fourier degree $\leq k$ or it is $\epsilon$-far from any Boolean function with Fourier degree $\leq k$. We improve the known lower bound of $\Omega(k)$ \cite{BBM11,CGM10}, to $\Omega(k/\sqrt{\epsilon})$. The lower bound uses the recently discovered connections between property testing and communication complexity by Blais \textit{et. al.} \cite{BBM11}

Affiliated with

Also associated with

No associations

Rating

Lower Bounds on Testing Functions of Low Fourier Degree does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Lower Bounds on Testing Functions of Low Fourier Degree, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Lower Bounds on Testing Functions of Low Fourier Degree will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-124856