{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T01:08:54Z","timestamp":1767229734761,"version":"3.48.0"},"publisher-location":"Cham","reference-count":9,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030934880"},{"type":"electronic","value":"9783030934897"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"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":[[2021]]},"DOI":"10.1007\/978-3-030-93489-7_1","type":"book-chapter","created":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:30:01Z","timestamp":1640997001000},"page":"1-12","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Complexity Issues for the Iterated h-Preorders"],"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"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4316-0859","authenticated-orcid":false,"given":"Victor","family":"Selivanov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,1,1]]},"reference":[{"key":"1_CR1","volume-title":"The Design and Analysis of Computer Algorithms","author":"A Aho","year":"1969","unstructured":"Aho, A., Hopcroft, J.V., Ullman, J.E.: The Design and Analysis of Computer Algorithms. Addison Wesley, Massachusetts (1969)"},{"issue":"6","key":"1_CR2","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":"I. Algebra Logic"},{"issue":"3","key":"1_CR3","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"},{"issue":"1","key":"1_CR4","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"},{"key":"1_CR5","unstructured":"Hertling P.: Topologische Komplexit\u00e4tsgrade von Funktionen mit endlichem Bild. Informatik-Berichte, vol. 152, 34 pages. Fernuniversit\u00e4t Hagen, December 1993"},{"key":"1_CR6","doi-asserted-by":"crossref","unstructured":"Hertling P., Selivanov V.L.: Complexity issues for preorders on finite labeled forests. In: Brattka, V., Diener, H., Spreen, D. (eds.) Logic, Computation, Hierarchies, pp. 165\u2013190. Ontos Publishing, de Gruiter, Boston-Berlin (2014)","DOI":"10.1515\/9781614518044.165"},{"key":"1_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/978-3-030-62536-8_16","volume-title":"Descriptional Complexity of Formal Systems","author":"V Selivanov","year":"2020","unstructured":"Selivanov, V.: Classifying $$\\omega $$-regular aperiodic k-partitions. In: Jir\u00e1skov\u00e1, G., Pighizzini, G. (eds.) DCFS 2020. LNCS, vol. 12442, pp. 193\u2013205. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-62536-8_16"},{"key":"1_CR8","unstructured":"Selivanov V.: Wadge degrees of classes of $$\\omega $$-regular $$k$$-partitions. Submitted, Arxiv:2104.10358"},{"key":"1_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1007\/978-3-030-80049-9_40","volume-title":"Connecting with Computability","author":"V Selivanov","year":"2021","unstructured":"Selivanov, V.: Non-collapse of the effective Wadge hierarchy. In: De Mol, L., Weiermann, A., Manea, F., Fern\u00e1ndez-Duque, D. (eds.) CiE 2021. LNCS, vol. 12813, pp. 407\u2013416. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-80049-9_40"}],"container-title":["Lecture Notes in Computer Science","Descriptional Complexity of Formal Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-93489-7_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T01:04:21Z","timestamp":1767229461000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-93489-7_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030934880","9783030934897"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-93489-7_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"1 January 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DCFS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Descriptional Complexity of Formal Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 September 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 September 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dcfs2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/toc.yonsei.ac.kr\/dcfs2021\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}