拟凸多项式极小化的一个新的复杂度为2^O(nlog n)的Lenstra型算法
A new Lenstra-type Algorithm for Quasiconvex Polynomial Integer Minimization with Complexity 2^O(n log n)
摘要:
研究了具有拟凸多项式约束的拟凸多项式的整数极小化问题。我们提出了一个新的算法,这是一个最有名的算法,由于海因茨(复杂性杂志,2005年)的改进。这种改进是通过应用一种新的现代Lenstra型算法,找到最佳的椭球面,并考虑多项式的稀疏编码。对于有界情形,当M是每个多项式中单项式个数的界,r是可行域上界的二进制编码长度时,算法的时间复杂度为s(rl Md)^{O(1)} 2^{2nlog_2(n)+ O(n)}.在一般情况下,s l^{O(1)} d^{O(n)} 2^{2n log_2(n)+O(n)}。在每一个中,我们假设d>= 2是多项式的全次数的界限,并且l限制输入的最大二进制编码大小。
英文摘要:
We study the integer minimization of a quasiconvex polynomial with quasiconvex polynomial constraints. We propose a new algorithm that is an improvement upon the best known algorithm due to Heinz (Journal of Complexity, 2005). This improvement is achieved by applying a new modern Lenstra-type algorithm, finding optimal ellipsoid roundings, and considering sparse encodings of polynomials. For the bounded case, our algorithm attains a time-complexity of s (r l M d)^{O(1)} 2^{2n log_2(n) + O(n)} when M is a bound on the number of monomials in each polynomial and r is the binary encoding length of a bound on the feasible region. In the general case, s l^{O(1)} d^{O(n)} 2^{2n log_2(n) +O(n)}. In each we assume d>= 2 is a bound on the total degree of the polynomials and l bounds the maximum binary encoding size of the input.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。