一个O(log N)时间的通用蛋下落问题算法
An $\mathcal{O}(\log N)$ Time Algorithm for the Generalized Egg Dropping Problem
AI总结:
本文提出一种O(log N)时间算法,通过限制二分搜索范围并利用增量遍历,解决通用蛋下落问题中的优化决策树构建问题。
摘要:
通用蛋下落问题是一个经典的顺序决策挑战。标准动态规划在O(K·N²)时间内计算最小测试数。已知方法将可测试阈值表示为二项系数的累加,并应用二分搜索将时间复杂度降低到O(K log N)。本文证明在完整顺序测试域上进行二分搜索是次优的。通过限制二分搜索在K的倍数上进行,我们隔离了一个动态结构包络,确保收敛。我们证明该边界平衡了搜索深度与组合评估成本,消除了K变量,严格将搜索阶段限制在O(log N)内。结合增量遍历,我们的算法消除了标准瓶颈。此外,我们提出了一种显式的O(1)空间策略,动态重构最优决策树。
英文摘要:
The generalized egg dropping problem is a classic challenge in sequential decision-making. Standard dynamic programming evaluates the minimax minimum number of tests in $\mathcal{O}(K \cdot N^2)$ time. A known approach formulates the testable thresholds as a partial sum of binomial coefficients and applies binary search to reduce the time complexity to $\mathcal{O}(K \log N)$. In this paper, we demonstrate that binary search over the complete sequential test domain is suboptimal. By restricting a binary search over multiples of $K$, we isolate a dynamic structural envelope that guarantees convergence. We prove that this boundary balances the search depth against the combinatorial evaluation cost, cancelling the $K$ variable to strictly bound the search phase to $\mathcal{O}(\log N)$. Combined with an incremental traversal, our algorithm eliminates the standard bottlenecks. Furthermore, we formulate an explicit $\mathcal{O}(1)$ space policy to dynamically reconstruct the optimal decision tree.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。