e/Tate's algorithm

Information
has gloss	eng: In the theory of elliptic curves, Tate's algorithm, described by , takes as input an integral model of an elliptic curve E over \mathbbQ} and a prime p. It returns the exponent f_p of p in the conductor of E, the type of reduction at p, the local index
lexicalization	eng: Tate's algorithm
instance of	e/Elliptic curve