A Canonical Form for Testing Boolean Function Properties

Published: 2011, Last Modified: 26 Jan 2026APPROX-RANDOM 2011EveryoneRevisionsBibTeXCC BY-SA 4.0
Abstract: In a well-known result Goldreich and Trevisan (2003) showed that every testable graph property has a “canonical” tester in which a set of vertices is selected at random and the edges queried are the complete graph over the selected vertices. We define a similar-in-spirit canonical form for Boolean function testing algorithms, and show that under some mild conditions property testers for Boolean functions can be transformed into this canonical form.
Loading