The old problem of computing the representation of a prime $p$ by a given quadratic form of discriminant $\Lambda$ is considered. This representation problem is shown to be solvable, under mild technical conditions, in polynomial complexity with respect to $p$. Further, a method is proposed which obtains the explicit representation of $p$ by the integer roots of univariate polynomials.
On the representation of primes by binary quadratic forms
Pintore, F
2018-01-01
Abstract
The old problem of computing the representation of a prime $p$ by a given quadratic form of discriminant $\Lambda$ is considered. This representation problem is shown to be solvable, under mild technical conditions, in polynomial complexity with respect to $p$. Further, a method is proposed which obtains the explicit representation of $p$ by the integer roots of univariate polynomials.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
