Super Unique Tarski is in UEOPL
Computational Complexity
2024-11-18 v3
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.
Cite
@article{arxiv.2411.05666,
title = {Super Unique Tarski is in UEOPL},
author = {John Fearnley and Rahul Savani},
journal= {arXiv preprint arXiv:2411.05666},
year = {2024}
}