Menu
Home
People
Places
Arts
History
Plants & Animals
Science
Life & Culture
Technology
Reference.org
Group isomorphism problem
open-in-new
<h2 id="references">References</h2> <ol> <li id="fn:1"><p>Dehn, Max (1911). "Über unendliche diskontinuierliche Gruppenn". Math. Ann. 71: 116–144. doi:10.1007/BF01456932. S2CID 123478582. <a href="/wiki/Max_Dehn" target="_blank">/wiki/Max_Dehn</a> <a href="#fnref:1" class="footnote-back-ref">↩</a></p></li> <li id="fn:2"><p>Magnus, Wilhelm; Karrass, Abraham & Solitar, Donald (1996). Combinatorial Group Theory: Presentations of Groups in Terms of Generators and Relations (2nd ed.). New York: Dover Publications. pp. 24–29. ISBN 0486632814. Retrieved 14 October 2022 – via VDOC.PUB. <a href="0486632814" target="_blank">0486632814</a> <a href="#fnref:2" class="footnote-back-ref">↩</a></p></li> <li id="fn:3"><p>Miller, Charles F. III (1992). "Decision Problems for Groups—survey and Reflections" (PDF). In Baumslag, Gilbert; Miller, C. F. III (eds.). Algorithms and Classification in Combinatorial Group Theory. Mathematical Sciences Research Institute Publications. Vol. 23. New York: Springer-Verlag. pp. 1–59. doi:10.1007/978-1-4613-9730-4_1. ISBN 9781461397328. (See Corollary 3.4) <a href="9781461397328" target="_blank">9781461397328</a> <a href="#fnref:3" class="footnote-back-ref">↩</a></p></li> <li id="fn:4"><p>Dahmani, François; Guirardel, Vincent (2011). "The isomorphism problem for all hyperbolic groups". Geometric and Functional Analysis. 21 (2): 223–300. arXiv:1002.2590. doi:10.1007/s00039-011-0120-0. S2CID 115165062. <a href="/wiki/Geometric_and_Functional_Analysis" target="_blank">/wiki/Geometric_and_Functional_Analysis</a> <a href="#fnref:4" class="footnote-back-ref">↩</a></p></li> <li id="fn:5"><p>Dahmani, François; Touikan, Nicholas (2019-01-01). "Deciding isomorphy using Dehn fillings, the splitting case". Inventiones Mathematicae. 215 (1): 81–169. arXiv:1311.3937. Bibcode:2019InMat.215...81D. doi:10.1007/s00222-018-0824-y. ISSN 1432-1297. <a href="https://link.springer.com/article/10.1007/s00222-018-0824-y" target="_blank">https://link.springer.com/article/10.1007/s00222-018-0824-y</a> <a href="#fnref:5" class="footnote-back-ref">↩</a></p></li> <li id="fn:6"><p>Pietrowski, Alfred (1974-06-01). "The isomorphism problem for one-relator groups with non-trivial centre". Mathematische Zeitschrift. 136 (2): 95–106. doi:10.1007/BF01214345. ISSN 1432-1823. <a href="https://link.springer.com/article/10.1007/BF01214345" target="_blank">https://link.springer.com/article/10.1007/BF01214345</a> <a href="#fnref:6" class="footnote-back-ref">↩</a></p></li> <li id="fn:7"><p>Pride, Stephen J. (1977). "The isomorphism problem for two-generator one-relator groups with torsion is solvable". Transactions of the American Mathematical Society. 227: 109–139. doi:10.1090/S0002-9947-1977-0430085-X. ISSN 0002-9947. <a href="https://www.ams.org/journals/tran/1977-227-00/S0002-9947-1977-0430085-X/" target="_blank">https://www.ams.org/journals/tran/1977-227-00/S0002-9947-1977-0430085-X/</a> <a href="#fnref:7" class="footnote-back-ref">↩</a></p></li> <li id="fn:8"><p>Hartnett, Kevin (23 June 2023). "Computer Scientists Inch Closer to Major Algorithmic Goal". Quanta Magazine. <a href="https://www.quantamagazine.org/computer-scientists-inch-closer-to-major-algorithmic-goal-20230623/" target="_blank">https://www.quantamagazine.org/computer-scientists-inch-closer-to-major-algorithmic-goal-20230623/</a> <a href="#fnref:8" class="footnote-back-ref">↩</a></p></li> <li id="fn:9"><p>Miller, Gary L. (1978). "On the nlog n isomorphism technique (A Preliminary Report)". Proceedings of the tenth annual ACM symposium on Theory of computing - STOC '78. ACM Press. pp. 51–58. doi:10.1145/800133.804331. ISBN 978-1-4503-7437-8. <a href="978-1-4503-7437-8" target="_blank">978-1-4503-7437-8</a> <a href="#fnref:9" class="footnote-back-ref">↩</a></p></li> <li id="fn:10"><p>Babai, László (January 9, 2017), Graph isomorphism update <a href="http://people.cs.uchicago.edu/~laci/update.html" target="_blank">http://people.cs.uchicago.edu/~laci/update.html</a> <a href="#fnref:10" class="footnote-back-ref">↩</a></p></li> <li id="fn:11"><p>Sun, Xiaorui (2023). "Faster Isomorphism for p-Groups of Class 2 and Exponent p". arXiv:2303.15412 [cs.DS]. <a href="/wiki/ArXiv_(identifier)" target="_blank">/wiki/ArXiv_(identifier)</a> <a href="#fnref:11" class="footnote-back-ref">↩</a></p></li> <li id="fn:12"><p>Hartnett, Kevin (23 June 2023). "Computer Scientists Inch Closer to Major Algorithmic Goal". Quanta Magazine. <a href="https://www.quantamagazine.org/computer-scientists-inch-closer-to-major-algorithmic-goal-20230623/" target="_blank">https://www.quantamagazine.org/computer-scientists-inch-closer-to-major-algorithmic-goal-20230623/</a> <a href="#fnref:12" class="footnote-back-ref">↩</a></p></li> </ol>