{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,20]],"date-time":"2025-10-20T10:27:19Z","timestamp":1760956039480},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2020,6,1]],"date-time":"2020-06-01T00:00:00Z","timestamp":1590969600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,6,1]],"date-time":"2020-06-01T00:00:00Z","timestamp":1590969600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["comput. complex."],"published-print":{"date-parts":[[2020,6]]},"DOI":"10.1007\/s00037-020-00195-7","type":"journal-article","created":{"date-parts":[[2020,6,24]],"date-time":"2020-06-24T02:03:16Z","timestamp":1592964196000},"update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Two-closures of  supersolvable permutation groups in polynomial time"],"prefix":"10.1007","volume":"29","author":[{"given":"Ilia","family":"Ponomarenko","sequence":"first","affiliation":[]},{"given":"Andrey","family":"Vasil\u2019ev","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,6,24]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"L\u00e1szl\u00f3 Babai (2018). Group, graphs, algorithms: the graph isomorphism problem. In Proceedings of the International Congress of Mathematicians\u2014Rio de Janeiro 2018. Vol. IV. Invited lectures, 3319\u20133336. World Sci. Publ., Hackensack, NJ","key":"195_CR1","DOI":"10.1142\/9789813272880_0183"},{"doi-asserted-by":"crossref","unstructured":"L\u00e1szl\u00f3 Babai & Eugene M. Luks (1983). Canonical Labeling of Graphs. In Proceedings of the Fifteenth Annual ACM Symposium on Theory of Computing, STOC 83, 171183. Association for Computing Machinery, New York, NY, USA","key":"195_CR2","DOI":"10.1145\/800061.808746"},{"key":"195_CR3","volume-title":"Coherent Configurations","author":"Gang Chen & Ilia Ponomarenko","year":"2019","unstructured":"Gang Chen & Ilia Ponomarenko: Coherent Configurations. Central China Normal University Press, Wuhan (2019)"},{"key":"195_CR4","volume-title":"Atlas of finite groups","author":"JH Conway","year":"1985","unstructured":"Conway, J.H., Curtis, R.T., Norton, S.P., Parker, R.A., Wilson, R.A.: Atlas of finite groups. Oxford University Press, Eynsham (1985)"},{"doi-asserted-by":"crossref","unstructured":"John D. Dixon & Brian Mortimer (1996). Permutation groups, volume 163 of Graduate Texts in Mathematics. Springer-Verlag, New York","key":"195_CR5","DOI":"10.1007\/978-1-4612-0731-3"},{"issue":"1\u20133","key":"195_CR6","first-page":"221","volume":"235","author":"Sergei Evdokimov & Ilia Ponomarenko","year":"2001","unstructured":"Sergei Evdokimov & Ilia Ponomarenko: Two-closure of odd permutation group in polynomial time. Discrete Math. 235(1\u20133), 221\u2013232 (2001)","journal-title":"Discrete Math."},{"issue":"6","key":"195_CR7","doi-asserted-by":"publisher","first-page":"813","DOI":"10.1090\/S1061-0022-04-00833-7","volume":"15","author":"Sergei Evdokimov & Ilia Ponomarenko","year":"2004","unstructured":"Sergei Evdokimov & Ilia Ponomarenko: Circulant graphs: recognizing and isomorphism testing in polynomial time. St. Petersbg. Math. J. 15(6), 813\u2013835 (2004)","journal-title":"St. Petersbg. Math. J."},{"issue":"6","key":"195_CR8","doi-asserted-by":"publisher","first-page":"1456","DOI":"10.1016\/j.ejc.2008.11.005","volume":"30","author":"Sergei Evdokimov & Ilia Ponomarenko","year":"2009","unstructured":"Sergei Evdokimov & Ilia Ponomarenko: Permutation group approach to association schemes. European J. Combin. 30(6), 1456\u20131476 (2009)","journal-title":"European J. Combin."},{"doi-asserted-by":"crossref","unstructured":"Walter Feit (1980). Some consequences of the classification of finite simple groups. In The Santa Cruz Conference on Finite Groups (Univ. California, Santa Cruz, Calif., 1979), volume 37 of Proc. Sympos. Pure Math., 175\u2013181. Amer. Math. Soc., Providence, R.I","key":"195_CR9","DOI":"10.1090\/pspum\/037\/604576"},{"issue":"1","key":"195_CR10","first-page":"1","volume":"4","author":"Donald G Higman","year":"1975","unstructured":"Higman, Donald G.: Coherent configurations. I. Ordinary representation theory. Geometriae Dedicata 4(1), 1\u201332 (1975)","journal-title":"I. Ordinary representation theory. Geometriae Dedicata"},{"issue":"4","key":"195_CR11","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1515\/jgth.2002.011","volume":"5","author":"Gareth A Jones","year":"2002","unstructured":"Jones, Gareth A.: Cyclic regular subgroups of primitive permutation groups. J. Group Theory 5(4), 403\u2013407 (2002)","journal-title":"J. Group Theory"},{"doi-asserted-by":"crossref","unstructured":"Martin W. Liebeck, Cheryl E. Praeger & Jan Saxl (1988). On the $$2$$-closures of finite permutation groups. J. London Math. Soc. (2)37(2), 241\u2013252","key":"195_CR12","DOI":"10.1112\/jlms\/s2-37.2.241"},{"issue":"1","key":"195_CR13","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1007\/BF01196622","volume":"5","author":"Ilia Ponomarenko","year":"1994","unstructured":"Ponomarenko, Ilia: Graph isomorphism problem and $$2$$-closed permutation groups. Appl. Algebra Engrg. Comm. Comput. 5(1), 9\u201322 (1994)","journal-title":"Appl. Algebra Engrg. Comm. Comput."},{"key":"195_CR14","first-page":"251","volume":"321","author":"Ilia Ponomarenko","year":"2005","unstructured":"Ponomarenko, Ilia: Determination of the automorphism group of a circulant association scheme in polynomial time. Zap. Nauchn. Semin. POMI 321, 251\u2013267 (2005)","journal-title":"Zap. Nauchn. Semin. POMI"},{"issue":"3","key":"195_CR15","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1112\/blms\/24.3.251","volume":"24","author":"Cheryl E Praeger","year":"1992","unstructured":"Praeger, Cheryl E., Saxl, Jan: Closures of finite primitive permutation groups. Bull. London Math. Soc. 24(3), 251\u2013258 (1992)","journal-title":"Bull. London Math. Soc."},{"doi-asserted-by":"crossref","unstructured":"\u00c1kos Seress (2003). Permutation group algorithms, volume 152 of Cambridge Tracts in Mathematics. Cambridge University Press, Cambridge","key":"195_CR16","DOI":"10.1017\/CBO9780511546549"},{"issue":"3","key":"195_CR17","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/s10469-019-09543-1","volume":"58","author":"Saveliy V Skresanov","year":"2019","unstructured":"Skresanov, Saveliy V.: Counterexamples to two conjectures in the Kourovka notebook. Algebra Logic 58(3), 249\u2013253 (2019)","journal-title":"Algebra Logic"},{"doi-asserted-by":"crossref","unstructured":"Andrey V. Vasil\u2019ev & Dmitriy (2019). The 2-closure of a $$\\frac{3}{2}$$-transitive group in polynomial time. Sib. Math. J. 60(2), 279\u2013290 (2019)","key":"195_CR18","DOI":"10.1134\/S0037446619020083"},{"key":"195_CR19","volume-title":"Finite permutation groups","author":"Helmut Wielandt","year":"1964","unstructured":"Wielandt, Helmut: Finite permutation groups. Academic Press, New York-London (1964)"},{"unstructured":"Helmut Wielandt (1969). Permutation groups through invariant relations and invariant functions. The Ohio State University","key":"195_CR20"},{"doi-asserted-by":"crossref","unstructured":"Robert A. Wilson (2009). The finite simple groups, volume 251 of Graduate Texts in Mathematics. Springer-Verlag London, Ltd., London","key":"195_CR21","DOI":"10.1007\/978-1-84800-988-2"},{"doi-asserted-by":"crossref","unstructured":"Jing Xu, Michael Giudici, Cai Heng Li & Cheryl E. Praeger (2011). Invariant relations and Aschbacher classes of finite linear groups. Electron. J. Combin.18(1), Paper 225","key":"195_CR22","DOI":"10.37236\/712"},{"issue":"1","key":"195_CR23","doi-asserted-by":"publisher","first-page":"795","DOI":"10.1515\/math-2019-0063","volume":"17","author":"Xue Yu & Jiangmin Pan","year":"2019","unstructured":"Xue Yu & Jiangmin Pan: 2-closures of primitive permutation groups of holomorph type. Open Math. 17(1), 795\u2013801 (2019)","journal-title":"Open Math."}],"container-title":["computational complexity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00037-020-00195-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00037-020-00195-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00037-020-00195-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,6,23]],"date-time":"2021-06-23T23:15:59Z","timestamp":1624490159000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00037-020-00195-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,6]]},"references-count":23,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2020,6]]}},"alternative-id":["195"],"URL":"https:\/\/doi.org\/10.1007\/s00037-020-00195-7","relation":{},"ISSN":["1016-3328","1420-8954"],"issn-type":[{"type":"print","value":"1016-3328"},{"type":"electronic","value":"1420-8954"}],"subject":[],"published":{"date-parts":[[2020,6]]},"assertion":[{"value":"21 December 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 June 2020","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"5"}}