Super Unique Tarski is in UEOPL
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , |
|---|---|
| Format: | Preprint |
| Publié: |
2024
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866929592326946816 |
|---|---|
| author | Fearnley, John Savani, Rahul |
| author_facet | Fearnley, John Savani, Rahul |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2411_05666 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Super Unique Tarski is in UEOPL Fearnley, John Savani, Rahul Computational Complexity 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. |
| title | Super Unique Tarski is in UEOPL |
| topic | Computational Complexity |
| url | https://arxiv.org/abs/2411.05666 |