A fast amortized algorithm for computing quadratic Dirichlet $L$-functions
Ghaith A. Hiary

TL;DR
This paper introduces an efficient amortized algorithm for computing quadratic Dirichlet L-functions across many characters, optimizing performance within specific conductor ranges.
Contribution
It presents a novel, nearly optimal algorithm for computing quadratic Dirichlet L-functions for multiple characters within a dyadic conductor window.
Findings
Algorithm achieves near-optimal performance up to logarithmic factors.
Efficiently handles large sets of quadratic characters.
Applicable within dyadic conductor ranges.
Abstract
An algorithm to compute Dirichlet -functions for many quadratic characters is derived. The algorithm is optimal (up to logarithmic factors) provided that the conductors of the characters under consideration span a dyadic window.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
