A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2013; you can also visit the original URL.
The file type is
We describe a general method for testing whether a function on n input variables has a concise representation. The approach combines ideas from the junta test of Fischer et al.  with ideas from learning theory, and yields property testers that make poly(s/ ) queries (independent of n) for Boolean function classes such as s-term DNF formulas (answering a question posed by Parnas et al. ), size-s decision trees, size-s Boolean formulas, and size-s Boolean circuits. The method can bedoi:10.1109/focs.2007.70 dblp:conf/focs/CanettiPS07 fatcat:rqvbzd4wbfasbhrjpafthjj45q