{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:49:49Z","timestamp":1725662989850},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540095262"},{"type":"electronic","value":"9783540350880"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1979]]},"DOI":"10.1007\/3-540-09526-8_24","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T11:47:21Z","timestamp":1330170441000},"page":"277-283","source":"Crossref","is-referenced-by-count":1,"title":["Bounds on computational complexity and approximability of initial segments of recursive sets"],"prefix":"10.1007","author":[{"given":"M. I.","family":"Dekhtjar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,26]]},"reference":[{"issue":"3","key":"24_CR1","first-page":"115","volume":"12","author":"M. I. Dekhtjar","year":"1976","unstructured":"Dekhtjar, M.I., On the complexity of approximation of recursive sets, EIK, 12 (1976), 3, 115\u2013122.","journal-title":"EIK"},{"key":"24_CR2","volume-title":"Complexity of algorithms and computations","author":"B. A. Trakhtenbrot","year":"1967","unstructured":"Trakhtenbrot, B.A., Complexity of algorithms and computations, Novosibirsk State University, Novosibirsk, 1967."},{"key":"24_CR3","volume-title":"Complexity of algorithms and computations, II","author":"V. N. Agafonov","year":"1975","unstructured":"Agafonov, V.N., Complexity of algorithms and computations, II, Novosibirsk State University, Novosibirsk, 1975."},{"key":"24_CR4","first-page":"220","volume":"20","author":"R. I. Freidzon","year":"1971","unstructured":"Freidzon, R.I., Regular approximation of recursive predicates, Zap. nauchn. sem. Leningradskogo otd. Mat. Inst. Steklova, 20 (1971), 220\u2013223.","journal-title":"Zap. nauchn. sem. Leningradskogo otd. Mat. Inst. Steklova"},{"issue":"5","key":"24_CR5","first-page":"79","volume":"4","author":"B. A. Trakhtenbrot","year":"1965","unstructured":"Trakhtenbrot, B.A., Optimal computations and frequency phenomenon of Jablonsky, Algebra and logic, 4 (1965), 5, 79\u201393.","journal-title":"Algebra and logic"},{"issue":"1\/2","key":"24_CR6","first-page":"11","volume":"15","author":"M. I. Dekhtjar","year":"1979","unstructured":"Dekhtjar, M.I., Complexity spectra of recursive sets and approximability of initial segments of complete problems, EIK, 15 (1979), 1\/2, 11\u201332.","journal-title":"EIK"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1979"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-09526-8_24.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T17:00:54Z","timestamp":1619542854000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-09526-8_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1979]]},"ISBN":["9783540095262","9783540350880"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/3-540-09526-8_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1979]]}}}