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.
生成讲解博客的中文版本
生成AI智能校验的中文版本