Property Testing via Set-Theoretic Operations

Details Property Testing via Set-Theoretic Operations Property Testing via Set-Theoretic Operations

2010-10-24

arxiv.org/abs/1010.4925v1

Computer Science

Data Structures and Algorithms

Appears in ICS 2011

Scientific paper

Given two testable properties $\mathcal{P}_{1}$ and $\mathcal{P}_{2}$, under what conditions are the union, intersection or set-difference of these two properties also testable? We initiate a systematic study of these basic set-theoretic operations in the context of property testing. As an application, we give a conceptually different proof that linearity is testable, albeit with much worse query complexity. Furthermore, for the problem of testing disjunction of linear functions, which was previously known to be one-sided testable with a super-polynomial query complexity, we give an improved analysis and show it has query complexity $O(1/\eps^2)$, where $\eps$ is the distance parameter.

Affiliated with

Also associated with

No associations

Rating

Property Testing via Set-Theoretic Operations 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 Property Testing via Set-Theoretic Operations, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Property Testing via Set-Theoretic Operations will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-277102