Improved Upper Bounds for Finding Tarski Fixed Points

Xi Chen, Yuhao Li

We study the query complexity of finding a Tarski fixed point over the $k$-dimensional grid $\{1,\dots ,n{\}}^k$. Improving on the previous best upper bound of $\smash{O(\log^{\lceil…