斜多项式乘法的拟最优下界
A quasi-optimal lower bound for skew polynomial multiplication
AI总结:
本文建立了斜多项式乘法的复杂度下界,与2017年猜想的上界仅差对数因子,并通过三种特殊情形的算法证明其拟最优性,同时探讨了平均双线性复杂度与扩张塔情形。
摘要:
我们建立了两个斜多项式相乘的复杂度下界。该下界与Caruso和Borgne在2017年猜想的上界一致,仅相差一个对数因子。我们针对三种特殊情况给出了算法,表明上述下界是拟最优的。事实上,我们的下界在双线性复杂度的意义下是拟最优的。此外,我们还讨论了斜多项式同时乘法的平均双线性复杂度,以及扩张塔情形下斜多项式乘法的复杂度。
英文摘要:
We establish a lower bound for the complexity of multiplying two skew polynomials. The lower bound coincides with the upper bound conjectured by Caruso and Borgne in 2017, up to a log factor. We present algorithms for three special cases, indicating that the aforementioned lower bound is quasi-optimal. In fact, our lower bound is quasi-optimal in the sense of bilinear complexity. In addition, we discuss the average bilinear complexity of simultaneous multiplication of skew polynomials and the complexity of skew polynomial multiplication in the case of towers of extensions.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。