Fetching the paper…
Reading the bibliography…
The classes PPA-$p$ have attracted attention lately, because they are the main candidates for capturing the complexity of Necklace Splitting with $p$ thieves, for prime $p$.
Über Abbildung von Mannigfaltigkeiten
L. E. J. Brouwer · 1911
Earlier work this paper cites.
Neuer Beweis für die Invarianz der Dimensionszahl und des Gebietes
Emanuel Sperner · 1928
Earlier work this paper cites.
Drei Sätze über die n-dimensionale euklidische Sphäre
Karol Borsuk · 1933
Earlier work this paper cites.
Démonstration d’une hypothèse de M. Artin
Claude Chevalley · 1935
Earlier work this paper cites.
Bemerkung zur vorstehenden Arbeit
Ewald Warning · 1935
Earlier work this paper cites.
Some topological properties of disk and sphere
Albert W. Tucker · 1945
Earlier work this paper cites.
Un théorème d’existence
Jerzy Neyman · 1946
Earlier work this paper cites.
Aufgabe 360
Martin Kneser · 1955
Earlier work this paper cites.
Some combinatorial lemmas in topology
Harold W. Kuhn · 1960
Earlier work this paper cites.
A moment problem in L1 approximation
Charles R. Hobby and John R. Rice · 1965
Earlier work this paper cites.
Fast multiple-precision evaluation of elementary functions
Richard P. Brent · 1976
Earlier work this paper cites.
Kneser’s conjecture, chromatic number, and homotopy
László Lovász · 1978
Earlier work this paper cites.
On a topological generalization of a theorem of Tverberg
Imre Bárány, Senya B. Shlosman, and András Szücs · 1981
Earlier work this paper cites.
A constructive proof of Tucker’s combinatorial lemma
Robert M. Freund and Michael J. Todd · 1981
Earlier work this paper cites.
How to assemble tree machines (Extended Abstract)
Sandeep N. Bhatt and Charles E. Leiserson · 1982
Earlier work this paper cites.
Simple proofs of some Borsuk-Ulam results
Albrecht Dold · 1983
Earlier work this paper cites.
Variable dimension complexes part I: Basic theory
Robert M. Freund · 1984
Earlier work this paper cites.
Elements of algebraic topology
James R. Munkres · 1984
Earlier work this paper cites.
Bisection of Circle Colorings
Charles H. Goldberg and Douglas B. West · 1985
Earlier work this paper cites.
The Borsuk-Ulam Theorem and Bisection of Necklaces
Noga Alon and Douglas B. West · 1986
Earlier work this paper cites.
The chromatic number of Kneser hypergraphs
Noga Alon, Peter Frankl, and László Lovász · 1986
Earlier work this paper cites.
Splitting necklaces
Noga Alon · 1987
Cited alongside, same era.
Some recent combinatorial applications of Borsuk-type theorems
Noga Alon · 1988
Cited alongside, same era.
Non-constructive proofs in combinatorics
Noga Alon · 1990
Cited alongside, same era.
On total functions, existence theorems and computational complexity
Nimrod Megiddo and Christos H. Papadimitriou · 1991
Cited alongside, same era.
A generalized van Kampen-Flores theorem
Karanbir S. Sarkaria · 1991
Cited alongside, same era.
A generalization of the ham sandwich theorem
Vladimir L. Dol’nikov · 1992
Cited alongside, same era.
On the complexity of the parity argument and other inefficient proofs of existence
The complexity of computing a Nash equilibrium
Constantinos Daskalakis, Paul W. Goldberg, and Christos H. Papadimitriou · 2009
Later among the works it cites.
On the complexity of Nash equilibria and other fixed points
Kousha Etessami and Mihalis Yannakakis · 2010
Later among the works it cites.
Continuous local search
Constantinos Daskalakis and Christos Papadimitriou · 2011
Later among the works it cites.
The complexity of gradient descent: CLS = PPAD ∩ \cap PLS
John Fearnley, Paul W. Goldberg, Alexandros Hollender, and Rahul Savani · 2011
Later among the works it cites.
Reductions and Propositional Proofs for Total NP Search Problems
Alan S. Johnson · 2011
Later among the works it cites.
Algorithmic solutions for envy-free cake cutting
Xiaotie Deng, Qi Qi, and Amin Saberi · 2012
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Christos H. Papadimitriou · 1994
Cited alongside, same era.
The Relative Complexity of NP Search Problems
Paul Beame, Stephen Cook, Jeff Edmonds, Russell Impagliazzo, and Toniann Pitassi · 1998
Cited alongside, same era.
A Sperner lemma complete for PPA
Michelangelo Grigni · 2001
Cited alongside, same era.
Algebraic topology
Allen Hatcher · 2002
Cited alongside, same era.
Generalized Kneser coloring theorems with combinatorial proofs
Günter M. Ziegler · 2002
Cited alongside, same era.
Consensus-halving via theorems of Borsuk-Ulam and Tucker
Forest W. Simmons and Francis E. Su · 2003
Cited alongside, same era.
Later among the works it cites.
Computing solutions of the paintshop-necklace problem
Frédéric Meunier and Bertrand Neveu · 2012
Later among the works it cites.
The complexity of non-monotone markets
Xi Chen, Dimitris Paparas, and Mihalis Yannakakis · 2013
Later among the works it cites.
Constant rank bimatrix games are PPAD-hard
Ruta Mehta · 2014
Later among the works it cites.
Simplotopal maps and necklace splitting
Frédéric Meunier · 2014
Later among the works it cites.
Consensus Halving is PPA-complete
Aris Filos-Ratsikas and Paul W. Goldberg · 2018
Later among the works it cites.
Hardness Results for Consensus-Halving
Aris Filos-Ratsikas, Søren Kristoffer Still Frederiksen, Paul W. Goldberg, and Jie Zhang · 2018
Later among the works it cites.
Inapproximability of Nash equilibrium
Aviad Rubinstein · 2018
Later among the works it cites.
PPP-completeness with connections to cryptography
Katerina Sotiraki, Manolis Zampetakis, and Giorgos Zirdelis · 2018
Later among the works it cites.
2-D Tucker is PPA complete
James Aisenberg, Maria Luisa Bonet, and Sam Buss · 2019
Later among the works it cites.
The Complexity of Splitting Necklaces and Bisecting Ham Sandwiches
Aris Filos-Ratsikas and Paul W. Goldberg · 2019
Later among the works it cites.
The Hairy Ball Problem is PPAD-Complete
Paul W. Goldberg and Alexandros Hollender · 2019
Later among the works it cites.
The Classes PPA-k: Existence from Arguments Modulo k
Alexandros Hollender · 2019
Later among the works it cites.
Consensus-Halving: Does it Ever Get Easier?
Aris Filos-Ratsikas, Alexandros Hollender, Katerina Sotiraki, and Manolis Zampetakis · 2020
Closest in time.
On the Complexity of Modulo-q Arguments and the Chevalley-Warning Theorem
Mika Göös, Pritish Kamath, Katerina Sotiraki, and Manolis Zampetakis · 2020
Closest in time.