{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:54:23Z","timestamp":1725663263739},"publisher-location":"Berlin, Heidelberg","reference-count":5,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540083535"},{"type":"electronic","value":"9783540372851"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1977]]},"DOI":"10.1007\/3-540-08353-7_146","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T11:24:09Z","timestamp":1330169049000},"page":"282-287","source":"Crossref","is-referenced-by-count":2,"title":["Arithmetical complexity of some problems in computer science"],"prefix":"10.1007","author":[{"given":"P.","family":"H\u00e1jek","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,24]]},"reference":[{"key":"24_CR1","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1137\/0204037","volume":"4","author":"T. Baker","year":"1975","unstructured":"Baker, T., Gill, J. and Solovay, R., Relativizations of the P = ? NP question, SIAM J. on Comp. 4 (1975), 431\u2013442.","journal-title":"SIAM J. on Comp."},{"key":"24_CR2","first-page":"255","volume":"45","author":"M. I. Dekhtyar","year":"1976","unstructured":"Dekhtyar, M.I., On the relation of deterministic and non-deterministic complexity classes, Mathematical Foundations of Computer Science 1976 (A. Mazurkiewicz, ed.), Lecture Notes in Computer Science vol. 45, p. 255\u2013259, Springer-Verlag 1976.","journal-title":"Mathematical Foundations of Computer Science"},{"key":"24_CR3","doi-asserted-by":"crossref","first-page":"35","DOI":"10.4064\/fm-49-1-35-92","volume":"49","author":"S. Feferman","year":"1960","unstructured":"Feferman, S., Arithmetization of metamathematics in a general setting, Fundamenta Mathematicae 49 (1960), 35\u201392.","journal-title":"Fundamenta Mathematicae"},{"issue":"4","key":"24_CR4","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1145\/1008335.1008336","volume":"8","author":"J. Hartmanis","year":"1976","unstructured":"Hartmanis, J. and Hopcroft, J.E., Independence results in computer science, SIGACT News 8, Number 4 (Oct.-Dec. 1976), 13\u201321.","journal-title":"SIGACT News"},{"key":"24_CR5","volume-title":"Theory of recursive functions and effective computability","author":"H. Rogers Jr.","year":"1967","unstructured":"Rogers, H., Jr., Theory of recursive functions and effective computability, McGrow-Hill, New York, 1967."}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1977"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-08353-7_146.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T16:52:12Z","timestamp":1619542332000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-08353-7_146"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1977]]},"ISBN":["9783540083535","9783540372851"],"references-count":5,"URL":"https:\/\/doi.org\/10.1007\/3-540-08353-7_146","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1977]]}}}