跳到正文
研踪PaperTrail
← 研踪 PaperTrail

arXiv:2611.23653 · v1

Faster polynomial-space algorithms for poset problems

首次提交 2026-11-18 08:18
版本更新 2026-11-18 08:18
雷达观测 2026-11-19 19:08
arXiv ↗PDF ↗

摘要

We give a polynomial-space, deterministic, exact algorithm for counting linear extensions of partial orders over nn elements, with running time O∗((22)n)⊆O(2.829n)O^*((2\sqrt{2})^{n}) \subseteq O(2.829^n). This improves upon the long-standing bound of O∗(4n)O^*(4^{n}) attainable by standard divide and conquer (Savitch 1970, Gurevich and Shelah 1987). Our algorithm uses a similar balanced splitting approach as the classical algorithm, but applies it only to the elements outside a largest antichain. For the elements of the antichain itself we develop a formula based on inclusion-exclusion that accounts for the ways in which they can appear in a linear extension. The technique is also applicable to other problems on posets, which we illustrate by solving the well-studied jump number problem in a similar running time of O∗((22)n)O^*((2\sqrt{2})^{n}) and polynomial space. To our knowledge, these are the first polynomial-space algorithms with a running time below 4n4^n for both problems.

AI 论文解读

基于摘要 · 非全文审阅

此版本尚未生成 AI 解读。解读由后台任务生成并按论文版本保存,登录后共享已有结果。

版本差异

目前只收录了一个版本。收录下一版后,可以对照标题、作者、分类和摘要。

观测到的版本

相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。

v1 · 2026-11-18 08:18 · 最新观测版本

Faster polynomial-space algorithms for poset problems

We give a polynomial-space, deterministic, exact algorithm for counting linear extensions of partial orders over nn elements, with running time O∗((22)n)⊆O(2.829n)O^*((2\sqrt{2})^{n}) \subseteq O(2.829^n). This improves upon the long-standing bound of O∗(4n)O^*(4^{n}) attainable by standard divide and conquer (Savitch 1970, Gurevich and Shelah 1987). Our algorithm uses a similar balanced splitting approach as the classical algorithm, but applies it only to the elements outside a largest antichain. For the elements of the antichain itself we develop a formula based on inclusion-exclusion that accounts for the ways in which they can appear in a linear extension. The technique is also applicable to other problems on posets, which we illustrate by solving the well-studied jump number problem in a similar running time of O∗((22)n)O^*((2\sqrt{2})^{n}) and polynomial space. To our knowledge, these are the first polynomial-space algorithms with a running time below 4n4^n for both problems.

查看此版本解读 →查看此版本原文 ↗