The following pages link to Consensus halving is PPA-complete (Q5230276):
Displaying 24 items.
- Towards a unified complexity theory of total functions (Q1745728) (← links)
- Consensus-halving via theorems of Borsuk-Ulam and Tucker (Q1810715) (← links)
- 2-D Tucker is PPA complete (Q2009648) (← links)
- 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)
- Almost envy-freeness for groups: improved bounds via discrepancy theory (Q2166776) (← links)
- Understanding PPA-completeness (Q2208253) (← links)
- Computing exact solutions of consensus halving and the Borsuk-Ulam theorem (Q2221804) (← links)
- The Hairy Ball problem is PPAD-complete (Q2229948) (← links)
- Hardness results for consensus-halving (Q5005124) (← links)
- The Hairy Ball Problem is PPAD-Complete. (Q5091222) (← links)
- Computing Exact Solutions of Consensus Halving and the Borsuk-Ulam Theorem (Q5092341) (← links)
- (Q5092469) (← links)
- Contiguous Cake Cutting: Hardness Results and Approximation Algorithms (Q5130002) (← 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)
- Consensus Halving for Sets of Items (Q5870379) (← links)
- (Q5881546) (← links)
- Consensus-Halving: Does It Ever Get Easier? (Q5890032) (← links)
- The classes PPA-\(k\): existence from arguments modulo \(k\) (Q5896088) (← links)
- The classes PPA-\(k\): existence from arguments modulo \(k\) (Q5918090) (← links)
- Fixed-Parameter Algorithms for the Kneser and Schrijver Problems (Q6154195) (← links)
- Note on constrained long choice with multiple beginning elements (Q6661767) (← links)
