Lyu, Saiyue2022-05-092022-05-092022-05-092022-04-29http://hdl.handle.net/10012/18243Sparse polynomials are those polynomials with only a few non-zero coefficients relative to their degree. They can appear in practice in polynomial systems as inputs, where the degree of the input sparse polynomial can be exponentially larger than the bit length of the representation of it. This leads to the difficulties when computing with sparse polynomials, as many efficient algorithms for dense polynomials take polynomial-time in the degree, and hence an exponential number of operations in a natural representation of the sparse polynomial. In this thesis, we explore new and faster methods for sparse polynomials and power series. We reconsider algorithms for the sparse perfect power problem and derive a faster sparsity-sensitive algorithm. We then show a fast new algorithm for sparse polynomial decomposition, again sensitive to the sparsity of the input and output. Finally, our algorithms to solve the sparse perfect power and decomposition problems lead us to explore a generalization to solving the linear differential equation with sparse polynomial coefficients using a Newton-like method. We demonstrate an algorithm which will find sparse solutions if they exist, in time polynomial in the input and the output.ensparse polynomialpolynomial decompositiondifferential equationcomplexityalgorithmMaster Thesis