On the Computational Complexity of Modular Symbols
From MaRDI portal
Publication:4024693
DOI10.2307/2153219zbMath0770.11026MaRDI QIDQ4024693
Publication date: 10 February 1993
Full work available at URL: https://doi.org/10.2307/2153219
fast algorithms; geodesic lines; polynomial time algorithms; period integrals; computation of modular symbols
11Y16: Number-theoretic algorithms; complexity
11F67: Special values of automorphic (L)-series, periods of automorphic forms, cohomology, modular symbols
Cites Work