{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:56:56Z","timestamp":1725663416465},"publisher-location":"Berlin, Heidelberg","reference-count":5,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540160663"},{"type":"electronic","value":"9783540397489"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1985]]},"DOI":"10.1007\/3-540-16066-3_13","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T13:35:53Z","timestamp":1330176953000},"page":"127-133","source":"Crossref","is-referenced-by-count":0,"title":["On the effectiveness of some operations on algorithms"],"prefix":"10.1007","author":[{"given":"Wojciech","family":"Kowalczyk","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,28]]},"reference":[{"key":"13_CR1","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/0022-0000(81)90021-0","volume":"22","author":"P. Chew","year":"1981","unstructured":"Chew, P. and Machtey, M. \/1981\/, A note on structure and looking back applied to the relative complexity of computable functions, J. Comput. System Sci. 22, 53\u201359.","journal-title":"J. Comput. System Sci."},{"key":"13_CR2","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1016\/0304-3975(83)90016-6","volume":"26","author":"J. Hartmanis","year":"1983","unstructured":"Hartmanis, J. \/1983\/, On G\u00f6del speed-up and succinctness of language representations\", Theor. Comput. Sci., 26, 335\u2013342.","journal-title":"Theor. Comput. Sci."},{"key":"13_CR3","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/0304-3975(81)90069-4","volume":"15","author":"L. Landweber","year":"1981","unstructured":"Landweber, L., Lipton, R. and Robertson, E. \/1981\/ On the structure of sets in NP and other complexity classes, Theoret. Comput. Sci., 15, 181\u2013200.","journal-title":"Theoret. Comput. Sci."},{"key":"13_CR4","volume-title":"Theory of recursive functions and effective computability","author":"H. Rogers","year":"1967","unstructured":"Rogers, H. \/1967\/, Theory of recursive functions and effective computability, McGraw-Hill, New York."},{"key":"13_CR5","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/0304-3975(82)90114-1","volume":"18","author":"U. Sch\u00f6ning","year":"1982","unstructured":"Sch\u00f6ning, U. \/1982\/, A uniform approach to obtain diagonal sets in complexity classes, Theoret. Comput. Sci., 18, 95\u2013103.","journal-title":"Theoret. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Computation Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-16066-3_13.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T17:02:48Z","timestamp":1619542968000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-16066-3_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985]]},"ISBN":["9783540160663","9783540397489"],"references-count":5,"URL":"https:\/\/doi.org\/10.1007\/3-540-16066-3_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1985]]}}}