Pages that link to "Item:Q1035680"
From MaRDI portal
The following pages link to On the complexity of 2D discrete fixed point problem (Q1035680):
Displayed 13 items.
- 2-D Tucker is PPA complete (Q2009648) (← links)
- On the complexity of finding a Caristi's fixed point (Q2032159) (← links)
- The complexity of finding fair independent sets in cycles (Q2087771) (← links)
- Discrete versions of the KKM lemma and their PPAD-completeness (Q2097223) (← links)
- Unique end of potential line (Q2194856) (← links)
- Understanding PPA-completeness (Q2208253) (← links)
- The Hairy Ball problem is PPAD-complete (Q2229948) (← links)
- Envy-free cake division without assuming the players prefer nonempty pieces (Q2279957) (← links)
- Unique End of Potential Line (Q5091211) (← links)
- The Hairy Ball Problem is PPAD-Complete. (Q5091222) (← links)
- Hardness of Continuous Local Search: Query Complexity and Cryptographic Lower Bounds (Q5138782) (← links)
- The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg (Q5241224) (← links)
- The Complexity of Necklace Splitting, Consensus-Halving, and Discrete Ham Sandwich (Q5863324) (← links)