A variant of the large sieve inequality with explicit constants

Abstract

We give an effective version with explicit constants of the large sieve inequality for imaginary quadratic fields. Explicit results of this kind are useful for estimating the computational complexity of algorithms which generate elements, whose norm is a rational prime, in an arithmetic progression of the corresponding ring of integers.

Keywords

• lage sieve
• computational complexity of algorithms
• 11l40
• 11n36
• 68q25