The following pages link to A Sperner lemma complete for PPA (Q1603412):
Displaying 15 items.
- \(\mathsf{PPAD}\)-completeness of polyhedral versions of Sperner's lemma (Q389197) (← links)
- On the black-box complexity of Sperner's Lemma (Q839637) (← links)
- On the complexity of 2D discrete fixed point problem (Q1035680) (← links)
- On the complexity of the parity argument and other inefficient proofs of existence (Q1329155) (← links)
- 2-D Tucker is PPA complete (Q2009648) (← links)
- Two's company, three's a crowd: consensus-halving for a constant number of agents (Q2093385) (← links)
- Understanding PPA-completeness (Q2208253) (← links)
- Computing exact solutions of consensus halving and the Borsuk-Ulam theorem (Q2221804) (← links)
- Oriented Euler complexes and signed perfect matchings (Q2340282) (← links)
- Computing Exact Solutions of Consensus Halving and the Borsuk-Ulam Theorem (Q5092341) (← links)
- (Q5092469) (← links)
- The Complexity of Necklace Splitting, Consensus-Halving, and Discrete Ham Sandwich (Q5863324) (← links)
- Consensus-Halving: Does It Ever Get Easier? (Q5890032) (← links)
- Logical Approaches to Computational Barriers (Q5898808) (← links)
- The classes PPA-\(k\): existence from arguments modulo \(k\) (Q5918090) (← links)
