{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T16:57:07Z","timestamp":1725469027587},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540377917"},{"type":"electronic","value":"9783540377931"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11821069_12","type":"book-chapter","created":{"date-parts":[[2006,8,25]],"date-time":"2006-08-25T06:25:12Z","timestamp":1156487112000},"page":"134-145","source":"Crossref","is-referenced-by-count":1,"title":["A Polynomial Time Nilpotence Test for Galois Groups and Related Results"],"prefix":"10.1007","author":[{"given":"V.","family":"Arvind","sequence":"first","affiliation":[]},{"given":"Piyush P","family":"Kurur","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"12_CR1","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1016\/0021-8693(82)90323-4","volume":"79","author":"L. Babai","year":"1982","unstructured":"Babai, L., Cameron, P.J., P\u00e1lfy, P.P.: On the order of primitive groups with restricted nonabelian composition factors. Journal of Algebra\u00a079, 161\u2013168 (1982)","journal-title":"Journal of Algebra"},{"key":"12_CR2","doi-asserted-by":"crossref","unstructured":"Fernandez-Ferreiros, P., Gomez-Molleda, M.A.: Deciding the nilpotency of the galois group by computing elements in the centre. Mathematics of Computation\u00a073(248) (2003)","DOI":"10.1090\/S0025-5718-03-01620-X"},{"key":"12_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/BFb0032845","volume-title":"EUROSAM 84","author":"S. Landau","year":"1984","unstructured":"Landau, S.: Polynomial time algorithms for galois groups. In: Fitch, J. (ed.) EUROSAM 1984 and ISSAC 1984. LNCS, vol.\u00a0174, pp. 225\u2013236. Springer, Heidelberg (1984)"},{"key":"12_CR4","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/0022-0000(85)90013-3","volume":"30","author":"S. Landau","year":"1985","unstructured":"Landau, S., Miller, G.L.: Solvability by radicals is in polynomial time. Journal of Computer and System Sciences\u00a030, 179\u2013208 (1985)","journal-title":"Journal of Computer and System Sciences"},{"key":"12_CR5","volume-title":"Algebra","author":"S. Lang","year":"1999","unstructured":"Lang, S.: Algebra, 3rd edn. Addison-Wesley Publishing Company, Inc., Reading (1999)","edition":"3"},{"issue":"2","key":"12_CR6","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1090\/S0273-0979-1992-00284-7","volume":"26","author":"H.W. Lenstra Jr.","year":"1992","unstructured":"Lenstra Jr., H.W.: Algorithms in algebraic number theory. Bulletin of the American Mathematical Society\u00a026(2), 211\u2013244 (1992)","journal-title":"Bulletin of the American Mathematical Society"},{"issue":"1","key":"12_CR7","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1016\/0022-0000(82)90009-5","volume":"25","author":"E.M. Luks","year":"1982","unstructured":"Luks, E.M.: Isomorphism of graphs of bounded valence can be tested in polynomial time. Journal of Computer and System Sciences\u00a025(1), 42\u201365 (1982)","journal-title":"Journal of Computer and System Sciences"},{"key":"12_CR8","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1090\/dimacs\/011\/11","volume":"11","author":"E.M. Luks","year":"1993","unstructured":"Luks, E.M.: Permutation groups and polynomial time computations. DIMACS Series in Discrete Mathematics and Theoretical Computer Science\u00a011, 139\u2013175 (1993)","journal-title":"DIMACS Series in Discrete Mathematics and Theoretical Computer Science"},{"key":"12_CR9","volume-title":"Finite Permutation Groups","author":"H. Wielandt","year":"1964","unstructured":"Wielandt, H.: Finite Permutation Groups. Academic Press, New York (1964)"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2006"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11821069_12.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T03:30:32Z","timestamp":1619494232000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11821069_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540377917","9783540377931"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/11821069_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}