Fast Computation of Generalized Dedekind Sums
arXiv:2210.01172
Abstract
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.
11 pages, 1 figure