Algorithms of the Möbius function by random forests and neural networks
Abstract The Möbius function $$\mu (n)$$ μ ( n ) is known for containing limited information on the prime factorization of n. Its known algorithms, however, are all based on factorization and hence are exponentially slow on $$\log n$$ log n . Consequently, a faster algorithm of $$\mu (n)$$ μ ( n ) c...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
SpringerOpen
2024-02-01
|
| Series: | Journal of Big Data |
| Subjects: | |
| Online Access: | https://doi.org/10.1186/s40537-024-00889-7 |