Extends Ting-Yao max-finding to non-distinct inputs via O(log |B|) simulation of each parity test, yielding O((log n)^3) depth with preserved O(n^{-c}) failure probability.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CC 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Parity Tests with Ties
Extends Ting-Yao max-finding to non-distinct inputs via O(log |B|) simulation of each parity test, yielding O((log n)^3) depth with preserved O(n^{-c}) failure probability.