{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:55:10Z","timestamp":1725663310509},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540515425"},{"type":"electronic","value":"9783540482376"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1989]]},"DOI":"10.1007\/3-540-51542-9_40","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T21:07:34Z","timestamp":1330204054000},"page":"487-498","source":"Crossref","is-referenced-by-count":0,"title":["Structured NC"],"prefix":"10.1007","author":[{"given":"Bertha","family":"Scholten","sequence":"first","affiliation":[]},{"given":"Jan","family":"Leeuwen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,26]]},"reference":[{"key":"40_CR1","volume-title":"The Design and Analysis of Computer Algorithms","author":"A. V. Aho","year":"1974","unstructured":"Aho, A.V., J.E. Hopcroft and J.D. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, MA, 1974."},{"key":"40_CR2","doi-asserted-by":"crossref","unstructured":"Buss, S.R., The boolean formala value problem is in ALOGTIME, Proc 19th Annual ACM Symp. on Theory of Computing, 1987, pp.123\u2013131.","DOI":"10.1145\/28395.28409"},{"key":"40_CR3","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1145\/322234.322243","volume":"28","author":"A. K. Chandra","year":"1981","unstructured":"Chandra, A.K., D.C. Kozen, L.J. Stockmeyer, Alternation, JACM 28 (1981), pp.114\u2013133.","journal-title":"JACM"},{"key":"40_CR4","first-page":"99","volume":"27","author":"S. A. Cook","year":"1981","unstructured":"Cook, S.A., Towards a complexity theory of synchronous parallel computation, Enseign. Math. 27 (1981), pp.99\u2013124.","journal-title":"Enseign. Math."},{"key":"40_CR5","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1016\/S0019-9958(85)80041-3","volume":"64","author":"S. A. Cook","year":"1985","unstructured":"Cook, S.A., A taxonomy of problems with fast parallel algorithms, Inform. and Control 64(1985), pp.2\u201322.","journal-title":"Inform. and Control"},{"key":"40_CR6","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/BF01744431","volume":"17","author":"M. Furst","year":"1984","unstructured":"Furst, M., J.B. Saxe and M. Sipser, Parity, circuits and the polynomial time hierarchy, Math. Systems Theory 17(1984), pp.13\u201328.","journal-title":"Math. Systems Theory"},{"key":"40_CR7","unstructured":"Karp, R.M. and V.L. Ramachandran, A survey of parallel algorithms for shared-memory machines, in: J. van Leeuwen (Ed.), Handbook of Theoretical Computer Science, North-Holland Publ. Comp., Amsterdam (to appear)."},{"key":"40_CR8","doi-asserted-by":"crossref","first-page":"831","DOI":"10.1145\/322217.322232","volume":"27","author":"R. E. Ladner","year":"1980","unstructured":"Ladner, R.E. and M.J. Fischer, Parallel prefix computation, JACM 27 (1980), pp.831\u2013838.","journal-title":"JACM"},{"key":"40_CR9","first-page":"137","volume":"5","author":"K. Mehlhorn","year":"1983","unstructured":"Mehlhorn, K. and F.P. Preparata, Area-time optimal VLSI integer multiplier with minimum computation time, IC 5(1983), pp.137\u2013156.","journal-title":"IC"},{"key":"40_CR10","first-page":"589","volume":"7","author":"Y. Ofman","year":"1963","unstructured":"Ofman, Y., On the algorithmic complexity of discrete functions, Sov. Phys. Dokl. 7 (1963), pp.589\u2013591.","journal-title":"Sov. Phys. Dokl."},{"key":"40_CR11","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1016\/0022-0000(80)90036-7","volume":"21","author":"W. L. Ruzzo","year":"1980","unstructured":"Ruzzo, W.L., Tree-size bounded alternation, J. Comp. Syst. Sci. 21 (1980), pp.218\u2013235.","journal-title":"J. Comp. Syst. Sci."},{"key":"40_CR12","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1016\/0022-0000(81)90038-6","volume":"22","author":"W. L. Ruzzo","year":"1981","unstructured":"Ruzzo, W.L., On uniform circuit complexity, J. Comp. Syst. Sci 22 (1981), pp.365\u2013383.","journal-title":"J. Comp. Syst. Sci"},{"key":"40_CR13","volume-title":"The Complexity of Computing","author":"J. E. Savage","year":"1976","unstructured":"Savage, J.E., The Complexity of Computing, Wiley, New York, 1976."},{"key":"40_CR14","series-title":"Techn. Rep.","volume-title":"Structured NC","author":"B. Scholten","year":"1989","unstructured":"Scholten, B. and J. van Leeuwen, Structured NC, Techn. Rep. RUU-CS-89-6, Dept. of Computer Science, University of Utrecht, Utrecht, 1989."},{"key":"40_CR15","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1007\/BF02242355","volume":"7","author":"A. Sch\u00f6nhage","year":"1971","unstructured":"Sch\u00f6nhage, A. and V. Strassen, Schnelle Multiplikation grosser Zahlen, Computing 7(1971), pp.281\u2013292.","journal-title":"Computing"},{"key":"40_CR16","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1109\/PGEC.1964.263830","volume":"EC-13","author":"C. S. Wallace","year":"1964","unstructured":"Wallace, C.S., A suggestion for a fast multiplier, IEEE Trans. Comp. EC-13(1964), pp.14\u201317.","journal-title":"IEEE Trans. Comp."},{"key":"40_CR17","volume-title":"The Complexity of Boolean Functions","author":"I. Wegener","year":"1987","unstructured":"Wegener, I., The Complexity of Boolean Functions, Wiley-Teubner, Stuttgart, 1987."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-51542-9_40.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:21:56Z","timestamp":1605648116000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-51542-9_40"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989]]},"ISBN":["9783540515425","9783540482376"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-51542-9_40","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1989]]}}}