使用漏斗堆的高效稀疏多项式分解
Efficient sparse polynomial factoring using the Funnel heap
摘要:
这项工作是Abu-Salem等人的全面扩展。(2015)研究了漏斗堆在多项式分解多项式的多面体方法中实现乘积和的能力,当多项式处于稀疏分布表示时。我们利用使用漏斗堆的插入操作的工作和缓存复杂度可以被细化为依赖于插入的单项乘积的秩,其中秩对应于其在漏斗堆中的生存期。通过优化在多面体方法的Hensel提升阶段期间发生插入和提取的模式,我们能够获得自适应漏斗堆,最大限度地减少该阶段的所有工作,缓存和空间复杂度。此外,我们进行了详细的实证研究,证实一旦交换到外部内存开始发生,漏斗堆优于通用的二进制堆。我们证明,漏斗堆是一个更有效的合并比缓存不经意的k-合并,这无法实现其最佳(和摊销)的缓存复杂性时,用于执行产品的总和。这提供了概念的经验证明,即使用一个全局漏斗堆执行乘积求和的重叠方法比串行化方法更适合,即使后者使用可用的最佳合并结构。
英文摘要:
This work is a comprehensive extension of Abu-Salem et al. (2015) that investigates the prowess of the Funnel Heap for implementing sums of products in the polytope method for factoring polynomials, when the polynomials are in sparse distributed representation. We exploit that the work and cache complexity of an Insert operation using Funnel Heap can be refined to de- pend on the rank of the inserted monomial product, where rank corresponds to its lifetime in Funnel Heap. By optimising on the pattern by which insertions and extractions occur during the Hensel lifting phase of the polytope method, we are able to obtain an adaptive Funnel Heap that minimises all of the work, cache, and space complexity of this phase. Additionally, we conduct a detailed empirical study confirming the superiority of Funnel Heap over the generic Binary Heap once swaps to external memory begin to take place. We demonstrate that Funnel Heap is a more efficient merger than the cache oblivious k-merger, which fails to achieve its optimal (and amortised) cache complexity when used for performing sums of products. This provides an empirical proof of concept that the overlapping approach for perform- ing sums of products using one global Funnel Heap is more suited than the serialised approach, even when the latter uses the best merging structures available.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。