Pages that link to "Item:Q389197"
From MaRDI portal
The following pages link to \(\mathsf{PPAD}\)-completeness of polyhedral versions of Sperner's lemma (Q389197):
Displaying 7 items.
- On the black-box complexity of Sperner's Lemma (Q839637) (← links)
- On the complexity of 2D discrete fixed point problem (Q1035680) (← links)
- A Sperner lemma complete for PPA (Q1603412) (← links)
- Colorful linear programming, Nash equilibrium, and pivots (Q1707915) (← links)
- Envy-free cake division without assuming the players prefer nonempty pieces (Q2279957) (← links)
- (Q3595354) (← links)
- Logical Approaches to Computational Barriers (Q5898808) (← links)