Zobrazeno 1 - 1
of 1
pro vyhledávání: '"Mousavian, Erfan"'
Optimal 3-way comparison search trees (3WCST's) can be computed using standard dynamic programming in time O(n^3), and this can be further improved to O(n^2) by taking advantage of the Monge property. In contrast, the fastest algorithm in the literat
Externí odkaz:
http://arxiv.org/abs/2311.02224
