Pages that link to "Item:Q3613784"
From MaRDI portal
The following pages link to On the Complexity of 2D Discrete Fixed Point Problem (Q3613784):
Displaying 10 items.
- \(\mathsf{PPAD}\)-completeness of polyhedral versions of Sperner's lemma (Q389197) (← links)
- Recent development in computational complexity characterization of Nash equilibrium (Q458453) (← links)
- On the black-box complexity of Sperner's Lemma (Q839637) (← links)
- A simplicial approach for discrete fixed point theorems (Q1014795) (← links)
- On the complexity of 2D discrete fixed point problem (Q1035680) (← links)
- Colorful linear programming, Nash equilibrium, and pivots (Q1707915) (← links)
- 2-D Tucker is PPA complete (Q2009648) (← links)
- A Direct Reduction from k-Player to 2-Player Approximate Nash Equilibrium (Q3162514) (← links)
- Constant Rank Two-Player Games are PPAD-hard (Q4554071) (← links)
- Quantum and classical query complexities of local search are polynomially related (Q5896965) (← links)