arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2104.05200cs.DScs.PF
收藏

解自然界线性丢番图方程算法性能的注记

A Note on the Performance of Algorithms for Solving Linear Diophantine Equations in the Naturals

Valeriu Motroi, Stefan Ciobaca

摘要:

我们实现了四个算法求解线性丢番图方程的自然:字典枚举算法,一个完成过程,一个基于图形的算法,和斜坡算法。如前所述,字典式枚举算法和完成过程比其他两种算法慢。我们更详细地比较了基于图的算法和斜率算法。与之前的比较相比,我们的工作表明,它们在小输入上同样快,但基于图的算法随着输入的增长而变得更快。我们的结论是AC统一算法的实现应该使用基于图的算法,以获得最大的效率。

英文摘要:

We implement four algorithms for solving linear Diophantine equations in the naturals: a lexicographic enumeration algorithm, a completion procedure, a graph-based algorithm, and the Slopes algorithm. As already known, the lexicographic enumeration algorithm and the completion procedure are slower than the other two algorithms. We compare in more detail the graph-based algorithm and the Slopes algorithm. In contrast to previous comparisons, our work suggests that they are equally fast on small inputs, but the graph-based algorithm gets much faster as the input grows. We conclude that implementations of AC-unification algorithms should use the graph-based algorithm for maximum efficiency.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑