On the Computational Complexity of Modular Symbols

DOI10.2307/2153219zbMath0770.11026OpenAlexW4240274310MaRDI QIDQ4024693

Dorian Goldfeld

Publication date: 10 February 1993

Full work available at URL: https://doi.org/10.2307/2153219

zbMATH Keywords

fast algorithmsgeodesic linespolynomial time algorithmsperiod integralscomputation of modular symbols

Mathematics Subject Classification ID

Number-theoretic algorithms; complexity (11Y16) Special values of automorphic (L)-series, periods of automorphic forms, cohomology, modular symbols (11F67)

Related Items

On $L$-functions of quadratic $\mathbb {Q}$-curves ⋮ Numerical modular symbols for elliptic curves

Cites Work

• Hecke operators on \(\Gamma_0(m)\)
• On the factors of the Jacobian variety of a modular function field
• Unnamed Item
• Unnamed Item
• Unnamed Item