Super Unique Tarski is in UEOPL
John Fearnley, Rahul Savani
TL;DR
This paper introduces the Super-Unique-Tarski problem, a special case of Tarski's fixed point problem with unique fixed points in all slices, and shows it resides in the complexity class UEOPL.
Contribution
The paper defines a new problem, Super-Unique-Tarski, and proves its membership in the complexity class UEOPL under promise-preserving reductions.
Findings
Super-Unique-Tarski is in UEOPL.
The problem involves Tarski instances with unique fixed points in all slices.
The result connects a new fixed point problem to a known complexity class.
Abstract
We define the Super-Unique-Tarski problem, which is a Tarski instance in which all slices are required to have a unique fixed point. We show that Super-Unique-Tarski lies in UEOPL under promise-preserving reductions.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Topics in Algebra