Subject
Computational Theory and Mathematics,Computational Mathematics,Control and Optimization
Reference24 articles.
1. On distinguishing prime numbers from composite numbers;Adleman;Ann. Math.,1983
2. On the number of primes less than a given limit;Bohman;BIT,1972
3. Multiplicative Number Theory;Davenport,1980
4. Asymptoticsche Entwicklungen der Dirichletschen L-Reihen;Deuring;Math. Ann.,1967
5. L. E. Dickson, “History of the Theory of Numbers,” Vol. 1, Chap. XVIII, reprint, Chelsea, New York.
Cited by
37 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. On Prime Counting Functions Using Odd $K$-Almost Primes;European Journal of Pure and Applied Mathematics;2024-04-30
2. Prime Numbers: Euclid and Eratosthenes;Springer Undergraduate Mathematics Series;2024
3. Polynomial-Time Pseudodeterministic Construction of Primes;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06
4. Summing $$\mu (n)$$: a faster elementary algorithm;Research in Number Theory;2022-12-08
5. Optimal mixing of Glauber dynamics: entropy factorization via high-dimensional expansion;Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing;2021-06-15