Class Invariants by the CRT Method

Andreas Enge, Andrew V. Sutherland

Type: Book-Chapter

Publication Date: 2010-01-01

Citations: 38

DOI: https://doi.org/10.1007/978-3-642-14518-6_14

Similar Works

Action	Title	Year	Authors
+ PDF Chat	Construction of invariants	2006	Mara Neusel
+	Numerical invariants of liaison classes	1984	Craig Huneke
+	Finite-Type Invariants	2006	Dror Bar-Natan
+	Finite-Type Invariants	2006	Dror Bar-Natan
+	Difference of Invariants	2015	Mark S. Joshi
+	Special classes of invariants	2010	Mara Neusel Larry Smith
+	Remarks on class-invariants and related topics	1966	S. Chowla
+	Polynomial invariants	2021
+	Definition of the Polynomial Invariants	1994	Robert Friedman John W. Morgan
+ PDF Chat	On arithmetic class invariants	2001	A. Agboola G. Pappas
+	A survey of loop invariants	2012	Carlo A. Furia Bertrand Meyer Sergey Velder
+ PDF Chat	Note on block invariants	1982	Xu Shen
+	An algorithm for determining a class of invariants in quasi-polynomial systems	2006	Barna Pongrácz Gábor Szederkényi Katalin M. Hangos
+	Computing invariants	1987	George R. Kempf
+	Examples of λ-invariants	1990	Nancy Childress
+	In search of structural invariants	1992	Milan Randić
+	An algorithm for determining a class of invariants in quasi-polynomial systems. (Research report SCL-002/2005.)	2005	Barna Pongrácz Gábor Szederkényi Katalin M. Hangos
+ PDF Chat	Equivalence relations, invariants, and normal functions	1982	Andreas Blass Yuri Gurevich
+	Sur la théorie classique des invariants	1977	Th. Vust
+	Modular Invariants	1995

Action	Title	Year	Authors
+	Class polynomials for nonholomorphic modular functions	2015	Jan Hendrik Bruinier Ken Ono Andrew V. Sutherland
+	Modular polynomials on Hilbert surfaces	2020	Enea Milio Damien Robert
+ PDF Chat	Square Root Algorithms for the Number Field Sieve	2012	Emmanuel Thomé
+ PDF Chat	Finding elliptic curves with a subgroup of prescribed size	2016	Igor E. Shparlinski Andrew V. Sutherland
+ PDF Chat	A quasi-linear time algorithm for computing modular polynomials in dimension 2	2015	Enea Milio
+ PDF Chat	Hard Isogeny Problems over RSA Moduli and Groups with Infeasible Inversion	2019	Salim Ali Altuğ Yilei Chen
+ PDF Chat	Improved CRT algorithm for class polynomials in genus 2	2013	Kristin Lauter Damien Robert
+ PDF Chat	Isogeny graphs of ordinary abelian varieties	2017	Ernest Hunter Brooks Dimitar Jetchev Benjamin Wesolowski
+	There are at most finitely many singular moduli that are <i>S</i>-units	2024	Sebastián Herrero Ricardo Menares Juan Rivera‐Letelier
+ PDF Chat	Isogeny volcanoes	2013	Andrew V. Sutherland

Action	Title	Year	Authors
+	Action of Modular Correspondences around CM Points	2002	Jean-Marc Couveignes Thiérry Hénocq
+ PDF Chat	Computing Hilbert Class Polynomials	2008	Juliana Belding Reinier Bröker Andreas Enge Kristin Lauter
+	Constructing elliptic curves of prescribed order	2008	Reinier Bröker
+	Class fields by Shimura reciprocity	2001	Alice Gee
+	Lehrbuch der Algebra	1921	Heinrich Weber
+ PDF Chat	Computing modular polynomials in quasi-linear time	2009	Andreas Enge
+ PDF Chat	Explicit bounds for primality testing and related problems	1990	Eric Bach
+ PDF Chat	Generalised Weber functions	2014	Andreas Enge François Morain
+ PDF Chat	Constructing elliptic curves over finite fields using double eta-quotients	2004	Andreas Enge Reinhard Schertz
+ PDF Chat	The complexity of class polynomial computation via floating point approximations	2008	Andreas Enge