The following pages link to Understanding PPA-completeness (Q2208253):
Displaying 5 items.
- On the complexity of 2D discrete fixed point problem (Q1035680) (← links)
- 2-D Tucker is PPA complete (Q2009648) (← links)
- Understanding PPA-completeness (Q5368757) (← links)
- The Complexity of Necklace Splitting, Consensus-Halving, and Discrete Ham Sandwich (Q5863324) (← links)
- Consensus-Halving: Does It Ever Get Easier? (Q5890032) (← links)