{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T21:10:18Z","timestamp":1742591418262,"version":"3.40.2"},"publisher-location":"Berlin, Heidelberg","reference-count":4,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540187400"},{"type":"electronic","value":"9783540481386"}],"license":[{"start":{"date-parts":[[1987,1,1]],"date-time":"1987-01-01T00:00:00Z","timestamp":536457600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1987]]},"DOI":"10.1007\/3-540-18740-5_81","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T19:45:32Z","timestamp":1330199132000},"page":"383-385","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["The parallel complexity of some arithmetic and algebraic operations"],"prefix":"10.1007","author":[{"given":"I. K.","family":"Rystsov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,2]]},"reference":[{"issue":"2","key":"81_CR1","doi-asserted-by":"crossref","first-page":"288","DOI":"10.1137\/0213028","volume":"13","author":"K. Chandra","year":"1984","unstructured":"Chandra K., Stockmeyer L., Vishkin U. Constant depth reducibility. \/\/ SIAM J.Computer. \u2014 1984 \u201413,No.2 \u2014 p.288\u2013299.","journal-title":"SIAM J.Computer."},{"key":"81_CR2","doi-asserted-by":"crossref","unstructured":"Beam P.,Cook S.,Hoover H. Log-depth circiuts and related problems. \/\/ 25-th Annual Symp. on Found. of Computer Science. \u2014 N.Y.: 1984\u2013p.1\u20136.","DOI":"10.1109\/SFCS.1984.715894"},{"issue":"1","key":"81_CR3","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1007\/BF01744431","volume":"17","author":"M. Furst","year":"1984","unstructured":"Furst M.,Saxe J.,Sipser M. Parity,circuits and polynomial time hierarchy. \/\/ Math. Systems Theory. \u2014 1984 \u2014 17,No.1 \u2014 p.13\u201327.","journal-title":"Math. Systems Theory"},{"issue":"31","key":"81_CR4","first-page":"110","volume":"14","author":"O.B. Lupanov","year":"1965","unstructured":"Lupanov O.B. Ob odnom podkhode k sintezu upravlyaushchikh sistem \u2014 printsipe lokalnogo kodirovaniya. \/\/ Problemy kibernetiki. \u2014 M.: Nauka, 1965 \u201414 \u2014 s.31 \u2014 110 (in Russian).","journal-title":"Problemy kibernetiki. \u2014 M.: Nauka"}],"container-title":["Lecture Notes in Computer Science","Fundamentals of Computation Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-18740-5_81","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T20:39:35Z","timestamp":1742589575000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-18740-5_81"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987]]},"ISBN":["9783540187400","9783540481386"],"references-count":4,"URL":"https:\/\/doi.org\/10.1007\/3-540-18740-5_81","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1987]]},"assertion":[{"value":"2 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}