23 citations · 48 across the 16 of their papers we have counts for
1 paper · 2 filters
Michele Elia, Federico Pintore
It is shown that, under some mild technical conditions, representations of prime numbers by binary quadratic forms can be computed in polynomial complexity by exploiting Schoof's a…