Cargando…
Summing [Formula: see text] : a faster elementary algorithm
We present a new elementary algorithm that takes [Formula: see text] (measured bitwise) for computing [Formula: see text] where [Formula: see text] is the Möbius function. This is the first improvement in the exponent of x for an elementary algorithm since 1985. We also show that it is possible to r...
| Autores principales: | , |
|---|---|
| Formato: | Online Artículo Texto |
| Lenguaje: | English |
| Publicado: |
Springer International Publishing
2022
|
| Materias: | |
| Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9731940/ https://www.ncbi.nlm.nih.gov/pubmed/36511765 http://dx.doi.org/10.1007/s40993-022-00408-8 |