2022/10/03 by Preston Tranbarger, Jessica Wang, Tranbarger, Preston +1 · 1 citation
Computer Science · Mathematics · #11F20 #Computability, Logic, AI Algorithms #FOS: Mathematics #History and Theory of Mathematics #Number Theory (math.NT)
paper · pdf · doi:10.48550/arxiv.2210.01172
openalex publication_date 2022/10/03 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We construct an algorithm that reduces the complexity for computing generalized Dedekind sums from exponential to polynomial time. We do so by using an efficient word rewriting process in group theory.