3 operation we want to sovle fast (for all x) 1. Evaluation == given A(x) and x0 compute A(x0) , naive = O(n^2), with Horner's Rule = O(n) Horner's Rue == A(x) = a0 +x(a1 +x(a2 + ... x(an)..)) == doing x product one at a time for evey step == O(n) 2. Addition == given A(x) ,B(x) compute C(x) = A(x) + B(x) , takes O(n) == ck = ak+bk (n)times 3. Multiplication == given A(x) B(x) compute C(x)=A(x)*..
