摘要

Let f be a fixed (holomorphic or Maass) modular cusp form. Let chi(q) be a Dirichlet character mod q. We describe a fast algorithm that computes the value L(1/2, f x chi(q)) up to any specified precision. In the case when q is smooth or highly composite integer, the time complexity of the algorithm is given by O(1 + vertical bar q vertical bar(5/6+o(1))).

  • 出版日期2013-5