Truly Sub-$3^n$ Min-Sum Subset Convolution and Join Ordering

2026-10-08来源 arXiv cs.DBEnglish
arXiv:2610.10282v1 Announce Type: cross Abstract: We present a deterministic reduction from min-sum subset convolution to min-plus matrix product. We show that if the min-plus product of two $D\times D$ matrices with $\beta$-bit integer entries can be computed in $D^{3-\delta}\operatorname{poly}(\beta,\log D)$ time for a fixed rational $0

原文：https://www.a8q9.cn/en/article/truly-sub-3-n-min-sum-subset-convolution-and-join-ordering-57693d.html

相关文章