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 → [N]3. Our algorithm runs in O(2 N) time and makes O(2 N) queries to F, matching the (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.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.