{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:14:21Z","timestamp":1725542061739},"publisher-location":"Berlin, Heidelberg","reference-count":5,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642106309"},{"type":"electronic","value":"9783642106316"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-10631-6_17","type":"book-chapter","created":{"date-parts":[[2009,12,4]],"date-time":"2009-12-04T02:03:43Z","timestamp":1259892223000},"page":"153-162","source":"Crossref","is-referenced-by-count":2,"title":["Hilbert\u2019s Thirteenth Problem and Circuit Complexity"],"prefix":"10.1007","author":[{"given":"Kristoffer Arnsfelt","family":"Hansen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Oded","family":"Lachish","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter Bro","family":"Miltersen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"17_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"366","DOI":"10.1007\/BFb0028575","volume-title":"STACS 98","author":"T. Hagerup","year":"1998","unstructured":"Hagerup, T.: Sorting and searching on the word RAM. In: Meinel, C., Morvan, M. (eds.) STACS 1998. LNCS, vol.\u00a01373, pp. 366\u2013398. Springer, Heidelberg (1998)"},{"key":"17_CR2","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1145\/1060590.1060629","volume-title":"STOC 2005: Proceedings of the 37th annual ACM symposium on Theory of computing","author":"M. Kouck\u00fd","year":"2005","unstructured":"Kouck\u00fd, M., Pudl\u00e1k, P., Th\u00e9rien, D.: Bounded-depth circuits: separating wires from gates. In: STOC 2005: Proceedings of the 37th annual ACM symposium on Theory of computing, pp. 257\u2013265. ACM, New York (2005)"},{"key":"17_CR3","first-page":"23","volume":"119","author":"O.B. Lupanov","year":"1958","unstructured":"Lupanov, O.B.: The synthesis of contact circuits. Dokl. Akad. Nauk SSSR (N.S.)\u00a0119, 23\u201326 (1958)","journal-title":"Dokl. Akad. Nauk SSSR (N.S.)"},{"key":"17_CR4","first-page":"782","volume":"3","author":"O.B. Lupanov","year":"1962","unstructured":"Lupanov, O.B.: Complexity of formula realization of functions of logical algebra. Prob. Kibernetki\u00a03, 782\u2013811 (1962)","journal-title":"Prob. Kibernetki"},{"key":"17_CR5","volume-title":"The complexity of Boolean functions","author":"I. Wegener","year":"1987","unstructured":"Wegener, I.: The complexity of Boolean functions. John Wiley & Sons, Inc., New York (1987)"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-10631-6_17.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T07:36:48Z","timestamp":1619768208000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-10631-6_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642106309","9783642106316"],"references-count":5,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-10631-6_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}