{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:54:26Z","timestamp":1725663266666},"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_150","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T11:24:39Z","timestamp":1330169079000},"page":"312-314","source":"Crossref","is-referenced-by-count":1,"title":["On the complexity of equivalent transformations in programming languages"],"prefix":"10.1007","author":[{"given":"Max I.","family":"Kanovi\u010d","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,24]]},"reference":[{"key":"28_CR1","unstructured":"Glu\u0161kov, V. M., Ceitlin, G. E. and Ju\u0161\u010denko, E. L., Algebra, languages, programming. Kiev, 1974."},{"key":"28_CR2","unstructured":"Markov, A. A., The theory of algorithms. Trudy Mat. Inst. Steklov, 42 (1954)."},{"key":"28_CR3","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1070\/IM1967v001n01ABEH000552","volume":"1","author":"A. A. Markov","year":"1967","unstructured":"Markov, A. A., Normal algorithms connected with the computation of Boolean functions. Math. USSR Izv. 1 (1967) pp. 151\u2013198.","journal-title":"Math. USSR Izv."},{"key":"28_CR4","first-page":"17","volume":"11","author":"M. I. Kanovi\u010d","year":"1970","unstructured":"Kanovi\u010d, M. I., On the complexity of enumeration and decision of predicates. Soviet Math. Dokl. 11 (1970) pp. 17\u201320.","journal-title":"Soviet Math. Dokl."},{"key":"28_CR5","doi-asserted-by":"crossref","unstructured":"Kanovi\u010d, M. I., The complexity of complete systems of equivalent transformations in programming languages. Soviet Math. Dokl. 18 (1977).","DOI":"10.1007\/3-540-08353-7_150"}],"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_150.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T14:59:21Z","timestamp":1605625161000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-08353-7_150"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1977]]},"ISBN":["9783540083535","9783540372851"],"references-count":5,"URL":"https:\/\/doi.org\/10.1007\/3-540-08353-7_150","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1977]]}}}