Fetching the paper…
Reading the bibliography…
Let $G$ be a nonabelian, simple group with a nontrivial conjugacy class $C \subseteq G$.
Kurt Reidemeister, Knoten und gruppen , Abh. Math. Sem. Univ. Hamburg 5
1927
Earlier work this paper cites.
Philip Hall, The Eulerian functions of a group , Quart. J. Math. 7
1936
Earlier work this paper cites.
James Munkres, Algorithms for the assignment and transportation problems , J. Soc. Indust. Appl. Math. 5
1957
Earlier work this paper cites.
Ralph H. Fox, A quick trip through knot theory , Topology of 3-manifolds and related topics (Proc. The Univ. of Georgia Institute, 1961), Prentice-Hall, 1962, pp. 120–167
1962
Earlier work this paper cites.
Richard H. Crowell and Ralph H. Fox, Introduction to knot theory , Graduate Texts in Mathematics, vol. 57, Springer-Verlag, 1977, Reprint of the 1963 original
1963
Earlier work this paper cites.
Kenneth A. Ribet, On l l -adic representations attached to modular forms , Invent. Math. 28
1975
Earlier work this paper cites.
Robert Gilman, Finite quotients of the automorphism group of a free group , Canad. J. Math 29
1977
Earlier work this paper cites.
Leslie G. Valiant, The complexity of computing the permanent , Theoret. Comput. Sci. 8
1979
Earlier work this paper cites.
Neal Brand, Classifying spaces for branched coverings , Indiana Univ. Math. J. 29
1980
Earlier work this paper cites.
L. G. Valiant and V. V. Vazirani, NP is as easy as detecting unique solutions , Theoret. Comput. Sci. 47
1986
Cited alongside, same era.
Michael D. Fried and Helmut Völklein, The inverse Galois problem and rational points on moduli spaces , Math. Ann. 290
1991
Cited alongside, same era.
Pierre de la Harpe and Vaughan F. R. Jones, Graph invariants related to statistical mechanical models: examples and problems , J. Combin. Theory Ser. B 57
1993
Cited alongside, same era.
John D. Dixon and Brian Mortimer, Permutation groups , Graduate Texts in Mathematics, vol. 163, Springer-Verlag, 1996
1996
Cited alongside, same era.
Charles H. Bennett, Ethan Bernstein, Gilles Brassard, and Umesh Vazirani, Strengths and weaknesses of quantum computing , SIAM J. Comput. 26
1997
Cited alongside, same era.
Nathan M. Dunfield and William P. Thurston, Finite covers of random 3-manifolds , Invent. Math. 166
2006
Later among the works it cites.
Sanjeev Arora and Boaz Barak, Computational complexity: a modern approach , Cambridge University Press, Cambridge, 2009
2009
Later among the works it cites.
2012
Later among the works it cites.
2015
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Jin-Yi Cai, Aduri Pavan, and D. Sivakumar, On the hardness of permanent , STACS 99 (Trier), Lecture Notes in Comput. Sci., vol. 1563, Springer, Berlin, 1999, pp. 90–99
1999
Cited alongside, same era.
Régis Barbanchon, On unique graph 3-colorability and parsimonious reductions in the plane , Theoret. Comput. Sci. 319
2004
Cited alongside, same era.
Mark Jerrum, Alistair Sinclair, and Eric Vigoda, A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries , J. ACM 51
2004
Cited alongside, same era.
Ian Agol, Joel Hass, and William Thurston, The computational complexity of knot genus and spanning area , Trans. Amer. Math. Soc. 358
2006
Cited alongside, same era.
Édouard Goursat, Sur les substitutions orthogonales et les divisions régulières de l’espace , Ann. Sci. École Norm. Sup. 6
Cited in the paper.
Cited in the paper.
The Complexity Zoo , http://www.complexityzoo.com/
Cited in the paper.
2015
Later among the works it cites.
Chaim Even-Zohar, Models of random knots , J. Appl. Comput. Topol. 1
2017
Later among the works it cites.
Eric Samperton, Schur-type invariants of branched G G -covers of surfaces , 2017, arXiv:1709.03182
2017
Later among the works it cites.
2018
Later among the works it cites.