We present quantum algorithms for these problems
that improve the best known classical complexity bounds.
we give the first application of the new quantum random walk technique by
Magniez, Nayak, Roland, and Santha 06
that improves the previous bounds by Ambainis 04 and Szegedy 04.
We also present several lower bounds for testing algebraic properties.