J.C. Lagarias, V.S. Miller, A.M. Odlyzko  Home/Search
Context
Related
| att.com/~amo/doc/ar...meissel.lehmer.ps belllabs.com/netli...meissel.lehmer.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: att.com/~amo/doc/complete (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: E. D. F. Meissel, a German astronomer, found in the 1870's a method for computing individual values of p(x), the counting function for the number of primes x. His method was based on recurrences for partial sieving functions, and he used it to compute p(10 9 ). D. H. Lehmer simplified and extended Meissel's method. We present further refinements of the Meissel-Lehmer method which incorporate some new sieving techniques. We give an asymptotic running time analysis of the resulting ... (Update)
Active bibliography (related documents): More All
0.3: Fast algorithms for multiple evaluations of the Riemann zeta .. - Odlyzko, Schönhage (1988) (Correct)
0.3: Disproof of the Mertens Conjecture - Odlyzko, Riele (1985) (Correct)
0.2: A Multiple Integral Evaluation Inspired by the Multi-WZ Method - Tefera (Correct)
Similar documents based on text: More All
0.5: Primes In Sequences Associated To Polynomials (after Lehmer) - Einsiedler, Everest, Ward (2000) (Correct)
0.4: Note on a polynomial of Emma Lehmer - Darmon (2000) (Correct)
0.4: Implementing the Lagarias-Odlyzko Analytic Algorithm for π(x) - Galway (1999) (Correct)
BibTeX entry: (Update)
@misc{ lagarias-computing,
author = "J.C. Lagarias and V.S. Miller and A.M. Odlyzko",
title = "Computing pi(x): The Meissel-Lehmer Method",
url = "citeseer.ist.psu.edu/8559.html" }
Citations (may not include all citations):1450 The Design and Analysis of Computer Algorithms (context) - Aho, Hopcraft et al. - 1974
38 History of the Theory of Numbers (context) - Dickson
5 What is an answer (context) - Wilf - 1982
3 An analytic method (context) - Lagarias, Odlyzko
2 Berechnung der Menge von Primzahlen (context) - Meissel
2 Berechnung der Menge von Primzahlen (context) - Meissel
1 the exact number of primes in the arithmetic progressions 4n.. (context) - Hudson, Brauer - 1977
1 New algorithms for computing p (context) - Lagarias, Odlyzko - 1981
1 Ueber Primzahlungen (context) - Meissel
1 Proceeding of the SIGPLAN 82 Symposium on Compiler Construct.. (context) - Auslander, Hopkins et al. - 1982
1 the number of primes less than a given limit (context) - Bohman - 1972
1 Chelsia reprint (context) - Landau - 1958
1 Uber die Bestimmung der Primzahlmenge innerhalb gegebener Gr.. (context) - Meissel
1 the exact number of primes less than a given limit (context) - Lehmer - 1959
1 Fast method for computing the number of primes less than a g.. (context) - Mapes - 1963
Documents on the same site (http://www.research.att.com/~amo/doc/complete.html): More
The Rise and Fall of Knapsack Cryptosystems - Odlyzko (1990) (Correct)
Smart and stupid networks: Why the Internet is like Microsoft - Odlyzko (1998) (Correct)
On the Number of Distinct Block Sizes in Partitions of a Set - Odlyzko, Richmond (1985) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC