Funder
Agence Nationale de la Recherche
Publisher
Springer Science and Business Media LLC
Subject
Algebra and Number Theory
Reference45 articles.
1. Arvind, V., Kurur, Piyush P.: Upper bounds on the complexity of some Galois theory problems (extended abstract). In: Algorithms and Computation. Lecture Notes in Comput. Sci., vol. 2906, pp. 716–725. Springer, Berlin (2003). https://doi.org/10.1007/978-3-540-24587-2_73
2. Booker, A.R., Then, H.: Rapid computation of L-functions attached to Maass forms. Int. J. Number Theory 14(5), 1459–1485 (2018). https://doi.org/10.1142/S1793042118500896
3. Bouw, I.I., Koutsianas, A., Sijsling, J., Wewers, S.: Conductor and discriminant of Picard curves. J. Lond. Math. Soc. (2) 102(1), 368–404 (2020). https://doi.org/10.1112/jlms.12323
4. Buchmann, J.: A subexponential algorithm for the determination of class groups and regulators of algebraic number fields. Séminaire de Théorie des Nombres, Paris 1988–1989. Progr. Math., vol. 91, pp. 27-41. Birkhäuser, Boston (1990)
5. Chevalley, C.: Deux théorèmes d’arithmétique. J. Math. Soc. Jpn. 3, 36–44 (1951). https://doi.org/10.2969/jmsj/00310036