{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,15]],"date-time":"2025-08-15T00:02:51Z","timestamp":1755216171671,"version":"3.43.0"},"publisher-location":"Singapore","reference-count":16,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819502172"},{"type":"electronic","value":"9789819502189"}],"license":[{"start":{"date-parts":[[2025,8,3]],"date-time":"2025-08-03T00:00:00Z","timestamp":1754179200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,8,3]],"date-time":"2025-08-03T00:00:00Z","timestamp":1754179200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-981-95-0218-9_27","type":"book-chapter","created":{"date-parts":[[2025,8,2]],"date-time":"2025-08-02T21:09:32Z","timestamp":1754168972000},"page":"367-380","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Finding Cycle Types in\u00a0Permutation Groups with\u00a0Few Generators"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4680-7198","authenticated-orcid":false,"given":"Markus","family":"Lohrey","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andreas","family":"Rosowski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,8,3]]},"reference":[{"doi-asserted-by":"publisher","unstructured":"Arora, S., Barak, B.: Computational Complexity - A Modern Approach. Cambridge University Press (2009). https:\/\/doi.org\/10.1017\/CBO9780511804090","key":"27_CR1","DOI":"10.1017\/CBO9780511804090"},{"key":"27_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1007\/978-3-319-03898-8_2","volume-title":"Parameterized and Exact Computation","author":"V Arvind","year":"2013","unstructured":"Arvind, V.: The parameterized complexity of fixpoint free elements and bases in permutation groups. In: Gutin, G., Szeider, S. (eds.) IPEC 2013. LNCS, vol. 8246, pp. 4\u201315. Springer, Cham (2013). https:\/\/doi.org\/10.1007\/978-3-319-03898-8_2"},{"doi-asserted-by":"publisher","unstructured":"Babai, L., Luks, E.M., Seress, \u00c1.: Permutation groups in NC. In: Proceedings of the 19th Annual ACM Symposium on Theory of Computing, STOC 1987, pp. 409\u2013420. ACM (1987). https:\/\/doi.org\/10.1145\/28395.28439","key":"27_CR3","DOI":"10.1145\/28395.28439"},{"doi-asserted-by":"publisher","unstructured":"B\u00f3na, M.: Combinatorics of Permutations, 3rd Edn. Discrete Mathematics and Its Applications. CRC Press (2022). https:\/\/doi.org\/10.1201\/9780429274107","key":"27_CR4","DOI":"10.1201\/9780429274107"},{"issue":"4","key":"27_CR5","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1016\/J.DISOPT.2005.08.005","volume":"2","author":"C Buchheim","year":"2005","unstructured":"Buchheim, C., J\u00fcnger, M.: Linear optimization over permutation groups. Discret. Optim. 2(4), 308\u2013319 (2005). https:\/\/doi.org\/10.1016\/J.DISOPT.2005.08.005","journal-title":"Discret. Optim."},{"doi-asserted-by":"publisher","unstructured":"Cameron, P.J.: Permutation Groups. Cambridge University Press (2010). https:\/\/doi.org\/10.1017\/CBO9780511623677","key":"27_CR6","DOI":"10.1017\/CBO9780511623677"},{"unstructured":"Cameron, P.J.: Lectures on derangements. In: Pretty Structures Conference in Paris, vol.\u00a0654 (2011)","key":"27_CR7"},{"issue":"3","key":"27_CR8","doi-asserted-by":"publisher","first-page":"408","DOI":"10.1016\/J.DISC.2009.03.005","volume":"310","author":"PJ Cameron","year":"2010","unstructured":"Cameron, P.J., Wu, T.: The complexity of the weight problem for permutation and matrix groups. Discret. Math. 310(3), 408\u2013416 (2010). https:\/\/doi.org\/10.1016\/J.DISC.2009.03.005","journal-title":"Discret. Math."},{"issue":"3","key":"27_CR9","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1016\/0196-6774(87)90018-6","volume":"8","author":"SA Cook","year":"1987","unstructured":"Cook, S.A., McKenzie, P.: Problems complete for deterministic logarithmic space. J. Algorithms 8(3), 385\u2013394 (1987). https:\/\/doi.org\/10.1016\/0196-6774(87)90018-6","journal-title":"J. Algorithms"},{"doi-asserted-by":"publisher","unstructured":"Furst, M.L., Hopcroft, J.E., Luks, E.M.: Polynomial-time algorithms for permutation groups. In: Proceedings of the 21st Annual Symposium on Foundations of Computer Science, FOCS 1980, pp. 36\u201341. IEEE Computer Society (1980). https:\/\/doi.org\/10.1109\/SFCS.1980.34","key":"27_CR10","DOI":"10.1109\/SFCS.1980.34"},{"unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP\u2013Completeness. Freeman (1979)","key":"27_CR11"},{"issue":"4","key":"27_CR12","doi-asserted-by":"publisher","first-page":"695","DOI":"10.1016\/S0022-0000(02)00025-9","volume":"65","author":"W Hesse","year":"2002","unstructured":"Hesse, W., Allender, E., Barrington, D.: Uniform constant-depth threshold circuits for division and iterated multiplication. J. Comput. Syst. Sci. 65(4), 695\u2013716 (2002). https:\/\/doi.org\/10.1016\/S0022-0000(02)00025-9","journal-title":"J. Comput. Syst. Sci."},{"key":"27_CR13","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/0304-3975(85)90047-7","volume":"36","author":"M Jerrum","year":"1985","unstructured":"Jerrum, M.: The complexity of finding minimum-length generator sequences. Theoret. Comput. Sci. 36, 265\u2013289 (1985). https:\/\/doi.org\/10.1016\/0304-3975(85)90047-7","journal-title":"Theoret. Comput. Sci."},{"unstructured":"Jordan, C.: Recherches sur les substitutions. J. de Math\u00e9matiques Pures et Appliqu\u00e9es 17, 351\u2013387 (1872). http:\/\/eudml.org\/doc\/234268","key":"27_CR14"},{"doi-asserted-by":"publisher","unstructured":"Sims, C.C.: Computational methods in the study of permutation groups. In: Computational Problems in Abstract Algebra, pp. 169\u2013183. Pergamon (1970). https:\/\/doi.org\/10.1016\/B978-0-08-012975-4.50020-5","key":"27_CR15","DOI":"10.1016\/B978-0-08-012975-4.50020-5"},{"doi-asserted-by":"publisher","unstructured":"Sims, C.C.: Computation with permutation groups. In: Proceedings of the 2nd ACM Symposium on Symbolic and Algebraic Manipulation, SYMSAC 1971, pp. 23\u201328. ACM (1971). https:\/\/doi.org\/10.1145\/800204.806264","key":"27_CR16","DOI":"10.1145\/800204.806264"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-95-0218-9_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,3]],"date-time":"2025-08-03T22:03:34Z","timestamp":1754258614000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-95-0218-9_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,8,3]]},"ISBN":["9789819502172","9789819502189"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-981-95-0218-9_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025,8,3]]},"assertion":[{"value":"3 August 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOON","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computing and Combinatorics Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Chengdu","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 August 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 August 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoon0","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/tcsuestc.com\/cocoon2025\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}