Property Testing via Set-Theoretic Operations
Name
Sudan_Property testing.pdf
Size
257 KB
Format
Adobe PDF
Checksum (MD5)
580d6bd755f96b9733725b422e2b2ad6
Author(s)
Chen, Victor
Sudan, Madhu
Xie, Ning
Date Issued
January 2011
Journal
Proceedings of the Second Symposium on Innovations in Computer Science, (ICS 2011)
Publisher
ITCS, Tsinghua University Press
Citation
Chen, Victor, Madhu Sudan and Ning Xie. "Property Testing via Set-Theoretic Operations
." Proceedings of the Second Symposium on Innovations in Computer Science - ICS 2011, Tsinghua University, Beijing, China, January 7-9, 2011. p.211-222.
Version
Author's final manuscript
Abstract
Given two testable properties P1 and P2, 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/ε2), where ε is the distance parameter.
MIT Department
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike 3.0
Persistent DSpace Link
DOI of Published Version
http://conference.itcs.tsinghua.edu.cn/ICS2011/content/paper/32.pdf
