A Levelset Algorithm for 3D-Tarksi

Published 16 Oct 2025 in cs.DS | (2510.14777v1)

Abstract: We present a simple new algorithm for finding a Tarski fixed point of a monotone function $F : [N]³ \rightarrow [N]^3$. Our algorithm runs in $O(\log² N)$ time and makes $O(\log² N)$ queries to $F$, matching the $Ω(\log² N)$ query lower bound due to Etessami et al.\ as well as the existing state-of-the-art algorithm due to Fearnley et al.

Abstract PDF Upgrade to Chat

Authors (2)

Summary

No one has generated a summary of this paper yet.

Sign Up to Summarize

Paper to Video (Beta)

No one has generated a video about this paper yet.

Sign Up to Generate All Videos Subscribe on YouTube

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Sign Up to Generate

Paper Prompts

Sign up for free to create and run prompts on this paper using GPT-5.

Top Community Prompts

Explain it Like I'm 14

Practical Applications

Conceptual Simplification

Sign Up to Activate View All Prompts

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.