Research output: Contribution to journal › Article › peer-review

264 KB, PDF document

Journal | Journal of Number Theory |
---|---|

Date | E-pub ahead of print - 23 Dec 2012 |

Date | Published (current) - May 2013 |

Issue number | 5 |

Volume | 133 |

Number of pages | 23 |

Pages (from-to) | 1502-1524 |

Early online date | 23/12/12 |

Original language | English |

Let $f$ be a fixed (holomorphic or Maass) modular cusp form. Let $\cq$ be a Dirichlet character mod $q$. We describe a fast algorithm that computes the value $L(1/2,f\times\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+|q|^{5/6+o(1)})$.

© 2012 Elsevier Inc. This is an author produced version of a paper published in Journal of Number Theory. Uploaded in accordance with the publisher's self-archiving policy.

- math.NT

Find related publications, people, projects, datasets and more using interactive charts.