 The Schwartz–Zippel algorithm provides a practical probabilistic solution, by simply randomly testing inputs and checking whether the output is zero.It was the first randomized polynomial time PIT algorithm to be proven correct.The larger the domain the inputs are drawn from, the less likely Schwartz–Zippel is to fail.