We present an efficient randomized algorithm to test if a given function f : Fn p Fp (where p is a prime) is a low-degree polynomial. This gives a local test for Generalized Reed...
Charanjit S. Jutla, Anindya C. Patthak, Atri Rudra...
We study the problem of monotonicity testing over the hypercube. As previously observed in several works, a positive answer to a natural question about routing properties of the hy...
We present a semi-parametric method for testing mixing distributions in the mixed Poisson model. The proposed method, which is based on the generalized method of moments, does not...
—We address the problem of determining what size test set guarantees statistically significant results in a character recognition task, as a function of the expected error rate. ...
Isabelle Guyon, John Makhoul, Richard M. Schwartz,...
We report on GADGET, a new software test generation system that uses combinatorial optimization to obtain condition/decision coverage of C/C++ programs. The GADGET system is fully...