The Nesting Bird Box Problem is ER-complete.
Title resolution pending
6 Pith papers cite this work, alongside 581 external citations. Polarity classification is still indexing.
6
Pith papers citing it
581
external citations · external index
citation-role summary
background 1
citation-polarity summary
years
2026 6roles
background 1polarities
unclear 1representative citing papers
Approximating the quantum value of tilted XOR games to constant precision is RE-complete, implying binary nonlocal games are RE-hard to approximate.
Proves ∃R-hardness of approximating MAX-ETR-INV to within a constant factor and gives polynomial-time 8-factor and nondeterministic 2-factor approximation algorithms.
Policy iteration for discounted robust MDPs is strongly polynomial for L1 and L∞ uncertainty sets but hard for other Lp sets.
In concurrent graph games with distributed private randomness, memoryless strategies decide threshold reachability (NP-hard) and almost-sure reachability is NP-complete; IRATL extends ATL for probability thresholds without shared randomness.
Provides complexity results for the constrained existence problem of five equilibrium notions in multiplayer graph games.
citing papers explorer
-
The Nesting Bird Box Problem is ER-complete: Sharp Hardness Results for the Hidden Set Problem
The Nesting Bird Box Problem is ER-complete.
-
XOR Games at Full Tilt: The Hardness of Binary Nonlocal Games
Approximating the quantum value of tilted XOR games to constant precision is RE-complete, implying binary nonlocal games are RE-hard to approximate.
-
Probabilistically checkable proofs for the Existential Theory of the Reals
Proves ∃R-hardness of approximating MAX-ETR-INV to within a constant factor and gives polynomial-time 8-factor and nondeterministic 2-factor approximation algorithms.
-
On the Complexity of Discounted Robust MDPs with $L_p$ Uncertainty Sets
Policy iteration for discounted robust MDPs is strongly polynomial for L1 and L∞ uncertainty sets but hard for other Lp sets.
-
Randomise Alone, Reach as a Team
In concurrent graph games with distributed private randomness, memoryless strategies decide threshold reachability (NP-hard) and almost-sure reachability is NP-complete; IRATL extends ATL for probability thresholds without shared randomness.
-
Equilibria in Multiplayer Graph Games: An Algorithmic Study
Provides complexity results for the constrained existence problem of five equilibrium notions in multiplayer graph games.