On the Complexity of 2D Discrete Fixed Point Problem
From MaRDI portal
Recommendations
- On the complexity of 2D discrete fixed point problem
- On the complexity of a two-point boundary value problem in different settings
- Computational complexity of fixed points and intersection points
- Computational complexity of fixed points
- Complexity of fixed point computation
- Complexity of nonlinear two-point boundary-value problems
- The scheme complexity of discrete optimization
- A simplicial approach for discrete fixed point theorems
- A Simplicial Approach for Discrete Fixed Point Theorems
- On the functional complexity of a two-dimensional interval search problem
Cited in
(13)- A simplicial approach for discrete fixed point theorems
- On the complexity of 2D discrete fixed point problem
- Colorful linear programming, Nash equilibrium, and pivots
- 2-D Tucker is PPA complete
- The Hairy Ball problem is PPAD-complete
- A direct reduction from k-player to 2-player approximate Nash equilibrium
- Locally 2-Dimensional Sperner Problems Complete for the Polynomial Parity Argument Classes
- \(\mathsf{PPAD}\)-completeness of polyhedral versions of Sperner's lemma
- Constant rank two-player games are PPAD-hard
- Recent development in computational complexity characterization of Nash equilibrium
- The Hairy Ball Problem is PPAD-Complete.
- Quantum and classical query complexities of local search are polynomially related
- On the black-box complexity of Sperner's Lemma
This page was built for publication: On the Complexity of 2D Discrete Fixed Point Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3613784)
