{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T11:05:44Z","timestamp":1758279944755},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1987,3,1]],"date-time":"1987-03-01T00:00:00Z","timestamp":541555200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[1987,3]]},"DOI":"10.1007\/bf02579204","type":"journal-article","created":{"date-parts":[[2007,3,22]],"date-time":"2007-03-22T21:14:06Z","timestamp":1174598046000},"page":"87-99","source":"Crossref","is-referenced-by-count":30,"title":["Computing the composition factors of a permutation group in polynomial time"],"prefix":"10.1007","volume":"7","author":[{"given":"Eugene M.","family":"Luks","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"BF02579204_CR1","volume-title":"The Design and Analysis of Computer Algorithms","author":"A. V. Aho","year":"1974","unstructured":"A. V. Aho, E. Hopcroft andJ. D. Ullman,The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, Mass., 1974."},{"key":"BF02579204_CR2","doi-asserted-by":"crossref","first-page":"911","DOI":"10.1090\/S0025-5718-1975-0367030-3","volume":"29","author":"M. D. Atkinson","year":"1975","unstructured":"M. D. Atkinson, An algorithm for finding the blocks of a permutation group,Math. Comp.,29 (1975), 911\u2013913.","journal-title":"Math. Comp."},{"key":"BF02579204_CR3","unstructured":"L. Babai, Monte Carlo algorithms in graph isomorphism testing,Tech. Rep. 79-10, D\u00e9p. Math. et Stat., Univ. de Montr\u00e9al, 1979."},{"key":"BF02579204_CR4","doi-asserted-by":"crossref","unstructured":"L. Babai, E. M. Luks, and\u00c1. Seress, Permutation groups in NC,to appear in Proc. 19 th Ann, ACM Symp. on Theory of computing (1987).","DOI":"10.1145\/28395.28439"},{"key":"BF02579204_CR5","doi-asserted-by":"crossref","unstructured":"L. Babai, W. M. Kantor andE. M. Luks, Computational complexity and the classification of finite simple groups,Proc. 24 th IEEE Symp. Found. Comp. Sci. (1983), 162\u2013171.","DOI":"10.1109\/SFCS.1983.10"},{"key":"BF02579204_CR6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1112\/blms\/13.1.1","volume":"13","author":"P. Cameron","year":"1981","unstructured":"P. Cameron, Finite permutation groups and finite simple groups,Bull. London Math. Soc. 13 (1981), 1\u201322.","journal-title":"Bull. London Math. Soc."},{"key":"BF02579204_CR7","doi-asserted-by":"crossref","first-page":"775","DOI":"10.2140\/pjm.1963.13.775","volume":"13","author":"W. Feit","year":"1963","unstructured":"W. Feit andJ. G. Thompson, Solvability of groups of odd order,Pacific J. Math.,13 (1963), 775\u20131029.","journal-title":"Pacific J. Math."},{"key":"BF02579204_CR8","doi-asserted-by":"crossref","unstructured":"M. Furst, J. Hopcroft andE. M. Luks, Polynomial-time algorithms for permutation groups,Proc. 21 st IEEE Symp. Found. Comp. Sci. (1980), 36\u201341.","DOI":"10.1109\/SFCS.1980.34"},{"key":"BF02579204_CR9","series-title":"Lecture Notes in Comp. Sci.","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-11493-9","volume-title":"Group-Theoretic Algorithms and Graph Isomorphism","author":"C. M. Hoffman","year":"1982","unstructured":"C. M. Hoffman,Group-Theoretic Algorithms and Graph Isomorphism, Lecture Notes in Comp. Sci.,136, Springer, Berlin, 1982."},{"key":"BF02579204_CR10","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1016\/0022-0000(85)90052-2","volume":"30","author":"W. M. Kantor","year":"1985","unstructured":"W. M. Kantor, Sylow\u2019s theorem in polynomial time,J. Comp. Syst. Sci.,30 (1985), 359\u2013394.","journal-title":"J. Comp. Syst. Sci."},{"key":"BF02579204_CR11","doi-asserted-by":"crossref","first-page":"478","DOI":"10.1016\/0196-6774(85)90029-X","volume":"6","author":"W. M. Kantor","year":"1985","unstructured":"W. M. Kantor, Polynomial-time algorithms for finding elements of prime order and Sylow subgroups,J. Algorithms,6 (1985), 478\u2013514.","journal-title":"J. Algorithms"},{"key":"BF02579204_CR12","unstructured":"W. M. Kantor andD. E. Taylor, Polynomial-time versions of Sylow\u2019s theorem,J. Algorithms, to appear."},{"key":"BF02579204_CR13","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1016\/0022-0000(82)90009-5","volume":"25","author":"E. M. Luks","year":"1982","unstructured":"E. M. Luks, Isomorphism of graphs of bounded valence can be tested in polynomial time,J. Comp. Syst. Sci.,25 (1982), 42\u201365.","journal-title":"J. Comp. Syst. Sci."},{"key":"BF02579204_CR14","unstructured":"E. M. Luks, The complexity of fixed valence graph isomorphism and the implications for general graph isomorphism,in preparation."},{"key":"BF02579204_CR15","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1016\/B978-0-08-012975-4.50020-5","volume-title":"Computational Problems in Abstract Algebra","author":"C. C. Sims","year":"1970","unstructured":"C. C. Sims, Computational methods in the study of permutation groups,in: Computational Problems in Abstract Algebra, (ed.: N. J. Leech), Pergamon, New York, 1970, 169\u2013183."}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02579204.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02579204\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02579204","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,18]],"date-time":"2019-05-18T16:44:59Z","timestamp":1558197899000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02579204"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987,3]]},"references-count":15,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1987,3]]}},"alternative-id":["BF02579204"],"URL":"https:\/\/doi.org\/10.1007\/bf02579204","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[1987,3]]}}}