Fast Computation of Generalized Dedekind Sums
Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:2ODQRDU5record.jsonopen to challenge →
classification
math.NT
keywords
dedekindgeneralizedsumsalgorithmcomplexitycomputationcomputingconstruct
read the original 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 paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.