Algorithmic Number Theory
From MaRDI portal
Publication:5899239
DOI10.1007/11792086zbMath1143.11323OpenAlexW2977481208WikidataQ29400612 ScholiaQ29400612MaRDI QIDQ5899239
Publication date: 2 May 2007
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11792086
Fourier coefficients of automorphic forms (11F30) Galois representations (11F80) Analytic computations (11Y35)
Related Items (6)
An effective bound for the Huber constant for cofinite Fuchsian groups ⋮ Combinatorial interpretations of Ramanujan's tau function ⋮ Finding elementary formulas for theta functions associated to even sums of squares ⋮ Recovering Fourier coefficients of some functions and factorization of integer numbers ⋮ A Polynomial with Galois Groups SL2(F16) ⋮ A Recursive Method for Computing Zeta Functions of Varieties
This page was built for publication: Algorithmic Number Theory