Modular forms are tremendously important in various areas of mathematics, from number theory and algebraic geometry to combinatorics and lattices. This title gives an algorithm for computing coefficients of modular forms of level one in polynomial time.