{"ID":2854693,"CreatedAt":"2026-06-01T04:54:23.091178241Z","UpdatedAt":"2026-06-01T04:54:23.091178241Z","DeletedAt":null,"paper_url":"https://arxiv.org/abs/2510.14777","arxiv_id":"2510.14777","title":"A Levelset Algorithm for 3D-Tarski","abstract":"We present a simple new algorithm for finding a Tarski fixed point of a monotone function $F : [N]^3 \\rightarrow [N]^3$. Our algorithm runs in $O(\\log^2 N)$ time and makes $O(\\log^2 N)$ queries to $F$, matching the $Ω(\\log^2 N)$ query lower bound due to Etessami et al. as well as the existing state-of-the-art algorithm due to Fearnley et al.","short_abstract":"We present a simple new algorithm for finding a Tarski fixed point of a monotone function $F : [N]^3 \\rightarrow [N]^3$. Our algorithm runs in $O(\\log^2 N)$ time and makes $O(\\log^2 N)$ queries to $F$, matching the $Ω(\\log^2 N)$ query lower bound due to Etessami et al. as well as the existing state-of-the-art algorithm...","url_abs":"https://arxiv.org/abs/2510.14777","url_pdf":"https://arxiv.org/pdf/2510.14777v2","authors":"[\"Sebastian Haslebacher\",\"Jonas Lill\"]","published":"2025-10-16T15:13:44Z","proceeding":"cs.DS","tasks":"[\"cs.DS\"]","methods":"[]","has_code":false}