Image de couverture de livre

Super Unique Tarski is in UEOPL

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Fearnley, John, Savani, Rahul
Format:	Preprint
Publié:	2024
Sujets:	Computational Complexity
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Monotone Contractions
par: Batziou, Eleni, et autres
Publié: (2024)

The Complexity of Computing KKT Solutions of Quadratic Programs
par: Fearnley, John, et autres
Publié: (2023)

The Complexity of Sparse Win-Lose Bimatrix Games
par: Batziou, Eleni, et autres
Publié: (2026)

Two Choices are Enough for P-LCPs, USOs, and Colorful Tangents
par: Borzechowski, Michaela, et autres
Publié: (2024)

On the enumeration of Tarski fixed points
par: Müller, Julian
Publié: (2023)

Constant Inapproximability for Fisher Markets
par: Deligkas, Argyrios, et autres
Publié: (2026)

Constant Inapproximability for PPA
par: Deligkas, Argyrios, et autres
Publié: (2022)

Fisher Markets with Approximately Optimal Bundles and the Need for a PCP Theorem for PPAD
par: Deligkas, Argyrios, et autres
Publié: (2026)

Pure-Circuit: Tight Inapproximability for PPAD
par: Deligkas, Argyrios, et autres
Publié: (2022)

Pizza Sharing is PPA-hard
par: Deligkas, Argyrios, et autres
Publié: (2020)

Tarski Lower Bounds from Multi-Dimensional Herringbones
par: Brânzei, Simina, et autres
Publié: (2025)

The Mystery Deepens: On the Query Complexity of Tarski Fixed Points
par: Chen, Xi, et autres
Publié: (2026)

The Randomized Query Complexity of Finding a Tarski Fixed Point on the Boolean Hypercube
par: Brânzei, Simina, et autres
Publié: (2024)

The Quantum Query Complexity of Finding a Tarski Fixed Point on the 2D Grid
par: Phillips, Reed
Publié: (2026)

Complexity of Planar Graph Orientation Consistency, Promise-Inference, and Uniqueness, with Applications to Minesweeper Variants
par: MIT Hardness Group, et autres
Publié: (2024)

A Quantum Unique Games Conjecture
par: Mousavi, Hamoon, et autres
Publié: (2024)

PSPACE-Hard 2D Super Mario Games: Thirteen Doors
par: MIT Hardness Group, et autres
Publié: (2024)

Communication Complexity is NP-hard
par: Hirahara, Shuichi, et autres
Publié: (2025)

AC^0[p]-Frege Cannot Efficiently Prove that Constant-Depth Algebraic Circuit Lower Bounds are Hard
par: Lu, Jiaqi, et autres
Publié: (2025)

You Can't Solve These Super Mario Bros. Levels: Undecidable Mario Games
par: MIT Hardness Group, et autres
Publié: (2024)

From Proof Complexity to Circuit Complexity via Interactive Protocols
par: Arteche, Noel, et autres
Publié: (2024)

Constructive Separations and Their Consequences
par: Chen, Lijie, et autres
Publié: (2022)

Exact Algorithms for Distance to Unique Vertex Cover
par: Fioravantes, Foivos, et autres
Publié: (2025)

Lossy Catalytic Computation
par: Gupta, Chetan, et autres
Publié: (2024)

On the Emergence of Ergodic Dynamics in Unique Games
par: Sahai, Tuhin, et autres
Publié: (2024)

Computational complexity of isometric tensor network states
par: Malz, Daniel, et autres
Publié: (2024)

Quantum information advantage based on Bell inequalities
par: Jain, Rahul, et autres
Publié: (2026)

Deterministic Hardness of Approximation of Unique-SVP and GapSVP in $\ell_p$ norms for $p>2$
par: Hecht, Yahli, et autres
Publié: (2025)

Simple Constructions of Unique Neighbor Expanders from Error-correcting Codes
par: Kopparty, Swastik, et autres
Publié: (2023)

Sampling from the Hardcore Model on Random Regular Bipartite Graphs above the Uniqueness Threshold
par: Kocurek, Nicholas, et autres
Publié: (2026)

Exponential-Size Circuit Complexity is Comeager in Symmetric Exponential Time
par: Hitchcock, John M.
Publié: (2026)

Unifying the Landscape of Super-Logarithmic Dynamic Cell-Probe Lower Bounds
par: Ko, Young Kun
Publié: (2025)

Random Permutations in Computational Complexity
par: Hitchcock, John M., et autres
Publié: (2025)

A Graphical #SAT Algorithm for Formulae with Small Clause Density
par: Laakkonen, Tuomas, et autres
Publié: (2022)

Unique extremality of affine maps on plane domains
par: Luo, Qiliang, et autres
Publié: (2025)

Unique Hard Attention: A Tale of Two Sides
par: Jerad, Selim, et autres
Publié: (2025)

The Zeta ($ζ$) Notation for Complex Asymptotes
par: Dutta, Anurag, et autres
Publié: (2023)

Runtime Repeated Recursion Unfolding in CHR: A Just-In-Time Online Program Optimization Strategy That Can Achieve Super-Linear Speedup
par: Fruehwirth, Thom
Publié: (2023)

Commuting Local Hamiltonians Beyond 2D
par: Bostanci, John, et autres
Publié: (2024)

Quantum Event Learning and Gentle Random Measurements
par: Watts, Adam Bene, et autres
Publié: (2022)