The hardness of computing an eigenform

zbMath1195.11167arXiv0708.1192MaRDI QIDQ3533254

Eric Bach, Denis Xavier Charles

Publication date: 23 October 2008

Full work available at URL: https://arxiv.org/abs/0708.1192

zbMATH Keywords

computational complexityRamanujan tau functioncomputing Fourier coefficients of Hecke eigenforms

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Fourier coefficients of automorphic forms (11F30) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analytic computations (11Y35)

Related Items (1)

Counting lattice vectors

This page was built for publication: The hardness of computing an eigenform