Fast Computation of Generalized Dedekind Sums

From MaRDI portal
Publication:6412784




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.










This page was built for publication: Fast Computation of Generalized Dedekind Sums

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6412784)