Preprint
Aug 2026
The Randomized Query Complexity of Finding Minimal Elements in Bounded-Width Posets
The known randomized upper bound has the correct asymptotic leading constant for every fixed width, based on a pairwise accounting of incomparable queries under a random-chain hard distribution and a unique ownership property for incomparable comparisons.
Luyao Fan, Jiayang Zou, Jia-Yang Gao et al.
· 0 citations