Property Testing via Set-Theoretic Operations
Author(s)Chen, Victor; Sudan, Madhu; Xie, Ning
MetadataShow full item record
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.
DepartmentMassachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory; Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Proceedings of the Second Symposium on Innovations in Computer Science, (ICS 2011)
ITCS, Tsinghua University Press
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.
Author's final manuscript