We present improved algorithms for testing monotonicity of functions. Namely, given the ability to query an unknown function $f$, where $\Sigma$ and $\Xi$ are finite ordered sets, the test always accepts a monotone $f$, and rejects $f$ with high probability if it is $\e$-far from being monotone (i.e., every monotone ... more >>>

An $\epsilon$-test for a property $P$ of functions from ${\cal D}=\{1,\ldots,d\}$ to the positive integers is a randomized algorithm, which makes queries on the value of an input function at specified locations, and distinguishes with high probability between the case of the function satisfying $P$, and the case that it ... more >>>

A standard property testing algorithm is required to determine with high probability whether a given object has property P or whether it is \epsilon-far from having P, for any given distance parameter \epsilon. An object is said to be \epsilon-far from having property P if at least an \epsilon-fraction of ... more >>>