$k$ - SUM的决策树复杂度最多接近二次
The Decision Tree Complexity for $k$-SUM is at most Nearly Quadratic
摘要:
Cardinal等人最近对$k$的线性决策树的复杂性进行了改进,导致了$O(n^3 \log^3{n})$线性查询,我们对$O(n^2 \log^2{n})$这样的查询提出了进一步的改进。
英文摘要:
Following a recent improvement of Cardinal et al. on the complexity of a linear decision tree for $k$-SUM, resulting in $O(n^3 \log^3{n})$ linear queries, we present a further improvement to $O(n^2 \log^2{n})$ such queries.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。