Naive algorithm? polynomial computed: (x1x2+x2X3)(x2+x4)-(x3-X5) X1 X2 X3 X4 X5 We can expand the two polynomials and compare their coefficients But it takes too much time. Size of the expansion can be exponential in the number of gates. Can you give such an example?Naïve algorithm? polynomial computed: (𝑥1𝑥2 + 𝑥2𝑥3)((𝑥2 + 𝑥4) − (𝑥3 − 𝑥5)) ◼ We can expand the two polynomials and compare their coefficients ◼ But it takes too much time. ❑ Size of the expansion can be exponential in the number of gates. ❑ Can you give such an example?  + −   + − 𝑥1 𝑥2 𝑥3 𝑥4 𝑥5 7