{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,21]],"date-time":"2025-10-21T02:53:43Z","timestamp":1761015223338,"version":"3.40.3"},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031095733"},{"type":"electronic","value":"9783031095740"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"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":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-09574-0_3","type":"book-chapter","created":{"date-parts":[[2022,6,23]],"date-time":"2022-06-23T17:36:07Z","timestamp":1656005767000},"page":"35-45","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Quotient Structures and\u00a0Groups Computable in\u00a0Polynomial Time"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5438-3092","authenticated-orcid":false,"given":"Pavel","family":"Alaev","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,6,24]]},"reference":[{"issue":"1","key":"3_CR1","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/0168-0072(91)90008-A","volume":"54","author":"D Cenzer","year":"1991","unstructured":"Cenzer, D., Remmel, J.: Polynomial time versus recursive models. Ann. Pure Appl. Logic 54(1), 17\u201358 (1991)","journal-title":"Ann. Pure Appl. Logic"},{"issue":"1\u20133","key":"3_CR2","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1016\/0168-0072(92)90076-C","volume":"56","author":"D Cenzer","year":"1992","unstructured":"Cenzer, D., Remmel, J.: Polynomial-time abelian groups. Ann. Pure Appl. Logic 56(1\u20133), 313\u2013363 (1992)","journal-title":"Ann. Pure Appl. Logic"},{"issue":"6","key":"3_CR3","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1007\/s10469-017-9416-y","volume":"55","author":"PE Alaev","year":"2016","unstructured":"Alaev, P.E.: Structures computable in polynomial time. I. Algebra Logic 55(6), 421\u2013435 (2016)","journal-title":"Algebra Logic"},{"issue":"3","key":"3_CR4","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1007\/s10469-020-09598-5","volume":"59","author":"PE Alaev","year":"2020","unstructured":"Alaev, P.E.: Polynomially computable structures with finitely many generators. Algebra Logic 59(3), 266\u2013272 (2020)","journal-title":"Algebra Logic"},{"key":"3_CR5","unstructured":"Alaev, P.E.: Finitely generated structures computable in polynomial time. Siberian Math. J. (submitted)"},{"issue":"6","key":"3_CR6","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1007\/s10469-020-09565-0","volume":"58","author":"PE Alaev","year":"2019","unstructured":"Alaev, P.E., Selivanov, V.L.: Fields of algebraic numbers computable in polynomial time. I. Algebra Logic 58(6), 447\u2013469 (2019)","journal-title":"I. Algebra Logic"},{"key":"3_CR7","doi-asserted-by":"crossref","unstructured":"Cenzer, D., Remmel, J. B.: Complexity theoretic model theory and algebra. In: Handbook of Recursive Mathematics, vol. 1, pp. 381\u2013513. Elsevier (1998)","DOI":"10.1016\/S0049-237X(98)80011-6"},{"key":"3_CR8","doi-asserted-by":"crossref","unstructured":"Alaev, P.E., Selivanov, V.L.: Fields of algebraic numbers computable in polynomial time. II. Algebra Logic 60(6) (2021)","DOI":"10.1007\/s10469-022-09661-3"},{"key":"3_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-030-80049-9_1","volume-title":"Connecting with Computability","author":"PE Alaev","year":"2021","unstructured":"Alaev, P.E., Selivanov, V.L.: Searching for applicable versions of computable structures. In: De Mol, L., Weiermann, A., Manea, F., Fern\u00e1ndez-Duque, D. (eds.) CiE 2021. LNCS, vol. 12813, pp. 1\u201311. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-80049-9_1"},{"key":"3_CR10","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/j.tcs.2017.01.029","volume":"674","author":"I Kalimullin","year":"2017","unstructured":"Kalimullin, I., Melnikov, A., Ng, K.M.: Algebraic structures computable without delay. Theoret. Comput. Sci. 674, 73\u201398 (2017)","journal-title":"Theoret. Comput. Sci."},{"key":"3_CR11","volume-title":"The Design and Analysis of Computer Algorithms","author":"AV Aho","year":"1974","unstructured":"Aho, A.V., Hopcroft, J.E., Ullman, J.D.: The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading (1974)"},{"issue":"4","key":"3_CR12","doi-asserted-by":"publisher","first-page":"1630","DOI":"10.1017\/jsl.2019.26","volume":"84","author":"N Bazhenov","year":"2019","unstructured":"Bazhenov, N., Harrison-Trainor, M., Kalimullin, I., Melnikov, A., Ng, K.M.: Automatic and polynomial-time algebraic structures. J. Symb. Logic 84(4), 1630\u20131669 (2019)","journal-title":"J. Symb. Logic"}],"container-title":["Lecture Notes in Computer Science","Computer Science \u2013 Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-09574-0_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,26]],"date-time":"2022-06-26T23:03:24Z","timestamp":1656284604000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-09574-0_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031095733","9783031095740"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-09574-0_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"24 June 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CSR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computer Science Symposium in Russia","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"St. Petersburg","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Russia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 June 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 July 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"csr2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/logic.pdmi.ras.ru\/csr2022\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"51","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"21","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"41% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"7","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}