Property Testing and Communication Complexity

نویسنده

  • Nicolas Pena
چکیده

Suppose that we are given as input an object O and we’d like to know if it has some property P . But querying the object is expensive, so we would like to do a small number of local queries on the object. Usually, deciding with certainty whether an object has a property or not will require a lot of queries. The idea of property testing is to answer an easier question, thus allowing less queries to be made. In property testing, given the object O, the tester has to distinguish in between objects that satisfy the property P and objects that are far from the property. The notion of “being far” depends on what the object is (distribution, function, graph...). The tester’s efficiency is measured by the number of queries it does on the object.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

CS 369 E : Communication Complexity ( for Algorithm Designers ) Lecture # 9 : Lower Bounds in Property Testing ∗

We first give a brief introduction to the field of property testing. Section 3 gives upper bounds for the canonical property of “monotonicity testing,” and Section 4 shows how to derive property testing lower bounds from communication complexity lower bounds. We won’t need to develop any new communication complexity; our existing toolbox (specifically, Disjointness) is already rich enough to de...

متن کامل

CS 369 E : Communication Complexity ( for Algorithm Designers ) Lecture # 8 : Lower Bounds in Property Testing ∗

We begin in this section with a brief introduction to the field of property testing. Section 2 explains the famous example of “linearity testing.” Section 3 gives upper bounds for the canonical problem of “monotonicity testing,” and Section 4 shows how to derive property testing lower bounds from communication complexity lower bounds. These lower bounds will follow from our existing communicati...

متن کامل

Deconstructions of Reductions from Communication Complexity to Property Testing using Generalized Parity Decision Trees

A few years ago, Blais, Brody, and Matulef (2012) presented a methodology for proving lower bounds for property testing problems by reducing them from problems in communication complexity. Recently, Bhrushundi, Chakraborty, and Kulkarni (2014) showed that some reductions of this type can be deconstructed to two separate reductions, from communication complexity to parity decision trees and from...

متن کامل

Lower Bounds on Testing Functions of Low Fourier Degree

We consider the problem of testing whether a Boolean function has Fourier degree ≤ k or it is ǫ-far from any Boolean function with Fourier degree ≤ k, we improve the known lower bound of Ω(k) [4, 6], to Ω(k/ √ ǫ). The lower bound uses the recently discovered connections between property testing and communication complexity by Blais et. al. [4]

متن کامل

Testing Properties of Boolean Functions: Lower Bounds on Testing Fourier Degree

We consider the problem of deciding whether a given object has a given property or it is far from any object with the property, referred to as property testing. We focus on the case where the objects are Boolean functions, and we survey some of the previously known results about testing for properties such as the number of relevant variables and Fourier degree of a Boolean function. We present ...

متن کامل

Deconstructions of Reductions from Communication Complexity to Property Testing using Generalized Parity

A few years ago, Blais, Brody, and Matulef (2012) presented a methodology for proving lower bounds for property testing problems by reducing them from problems in communication complexity. Recently, Bhrushundi, Chakraborty, and Kulkarni (2014) showed that some reductions of this type can be deconstructed to two separate reductions, from communication complexity to randomized parity decision tre...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014