The following pages link to Computing Modular Polynomials (Q5697474):
Displaying 5 items.
- An explicit height bound for the classical modular polynomial (Q993487) (← links)
- Cryptographic hash functions from expander graphs (Q1027970) (← links)
- Better path-finding algorithms in LPS Ramanujan graphs (Q1755951) (← links)
- Computing modular polynomials in quasi-linear time (Q3055173) (← links)
- Computing modular polynomials and isogenies of rank two Drinfeld modules over finite fields (Q4998642) (← links)
