Harry G. Mairson
Abstract
Given an integer N, what is the computational complexity of finding all the primes less than N? A modified sieve of Eratosthenes using doubly linked lists yields an algorithm of OA(N) arithmetic complexity. This upper bound is shown to be equivalent to the theoretical lower bound for sieve methods without preprocessing. Use of preprocessing techniques involving space-time and additive-multiplicative tradeoffs reduces this upper bound to OA(N/log logN) and the bit complexity to OB(N logN log log logN). A storage requirement is described using OB(N logN/log logN) bits as well.
- 1 Aho, A., Hopcraft, J., and Ullman, J. The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, Mass., 1974. Google Scholar
Digital Library
- 2 Chartres, B.A. Algorithms 310-311: Prime number generators 1 and 2. Comm. ACM 10, 9 (Sept. 1967), 569-570. Google ScholarDigital Library
- 3 Knuth, D.E. The Art of Computer Programming, Vol. 1: FundamentalAlgorithms. Addison-Wesley, Reading, Mass., 1973. Google ScholarDigital Library
- 4 Niven, I., and Zuckerman, H. An Introduction to the Theory of Numbers. Wiley, New York, 1960, chap. 2.Google Scholar
- 5 Singleton, R.C. Algorithms 356-357: Prime number generation using the treesort principle. Comm. ACM 12, 10 (Oct. 1969), 563- 564. Google ScholarDigital Library
- 6 Wood, T.C. Algorithm 35: Sieve. Comm. ACM 4, 3 (March 1961), 151. Google ScholarDigital Library
Recommendations
Super-linear time-space tradeoff lower bounds for randomized computation
FOCS '00: Proceedings of the 41st Annual Symposium on Foundations of Computer ScienceWe prove the first time-space lower bound tradeoffs for randomized computation of decision problems. The bounds hold even in the case that the computation is allowed to have arbitrary probability of error on a small fraction of inputs. Our techniques ...
Efficient ways of prime number generation for ring signatures
The authors describe two different algorithms to perform efficiently the ring signature keys generation. Given an integer size, l, their algorithms find efficiently (memory and time, respectively) two distinct l /2‐bit primes (e1, e2) such that e = 2e1 e2 ...
New lower bounds for halfspace emptiness
FOCS '96: Proceedings of the 37th Annual Symposium on Foundations of Computer ScienceThe author derives a lower bound of /spl Omega/(n/sup 4/3/) for the halfspace emptiness problem: given a set of n points and n hyperplanes in R/sup 5/, is every point above every hyperplane__ __ This matches the best known upper bound to within ...
Comments