The following pages link to 2-D Tucker is PPA complete (Q2009648):
Displaying 8 items.
- The complexity of the parity argument with potential (Q2037189) (← links)
- The complexity of finding fair independent sets in cycles (Q2087771) (← links)
- Two's company, three's a crowd: consensus-halving for a constant number of agents (Q2093385) (← links)
- Computing exact solutions of consensus halving and the Borsuk-Ulam theorem (Q2221804) (← links)
- The Hairy Ball problem is PPAD-complete (Q2229948) (← links)
- (Q5005124) (← links)
- (Q5092469) (← links)
- The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg (Q5241224) (← links)
