EFFICIENT ALGORITHMS FOR DETERMINING P(c) FOR SPARSE POLYNOMIALS.

The article presents a study which discusses the efficient algorithms for determining P(c) for sparse polynomials. It also presents a technique which is far from complex and remain in the realm of the mechanical manipulation and avoids the newest technological developments and the utilization of the computer algorithm. The study examines commonly recognized algorithms for calculating the value of a polynomial P(x) at x=c and synthesizes some findings and applications from algebra, numerical analysis, calculus, and computer programming. In conclusion, it stated that in respect to the number of necessary multiplications, an algorithm has been developed which is significantly more effective than traditional algorithms.