{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:04:20Z","timestamp":1725663860977},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540527534"},{"type":"electronic","value":"9783540471370"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1990]]},"DOI":"10.1007\/3-540-52753-2_45","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T21:42:20Z","timestamp":1330206140000},"page":"267-270","source":"Crossref","is-referenced-by-count":1,"title":["Reducibility of monotone formulas to \u03bc-formulas"],"prefix":"10.1007","author":[{"given":"Daniele","family":"Mundici","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,8]]},"reference":[{"key":"17_CR1","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/0001-8708(85)90118-5","volume":"58","author":"M. Haiman","year":"1985","unstructured":"M. Haiman, Proof theory for linear lattices, Advances in Math.58 (1985) 209\u2013242.","journal-title":"Advances in Math."},{"key":"17_CR2","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1007\/3-540-16078-7_83","volume":"210","author":"H.B. Hunt III","year":"1986","unstructured":"H.B. Hunt, III, R.E. Stearns, Monotone boolean functions, distributive lattices, and the complexity of logics, algebraic structures, and computation structures, In: Lecture Notes in Computer Science, Vol. 210 (Springer, Berlin, 1986) 277\u2013290.","journal-title":"Lecture Notes in Computer Science"},{"key":"17_CR3","doi-asserted-by":"crossref","unstructured":"D.Mundici, Functions computed by monotone Boolean formulas with no repeated variables, Theoretical Computer Science66 (1989).","DOI":"10.1016\/0304-3975(89)90150-3"},{"key":"17_CR4","doi-asserted-by":"publisher","first-page":"965","DOI":"10.1145\/48014.63140","volume":"35","author":"L. Pitt","year":"1988","unstructured":"L. Pitt, L.G. Valiant, Computational Limitations on Learning from Examples, J. ACM35 (1988) 965\u2013984.","journal-title":"J. ACM"},{"key":"17_CR5","volume-title":"The Complexity of Computing","author":"J.E. Savage","year":"1976","unstructured":"J.E. Savage, The Complexity of Computing, (J. Wiley, New York 1976)."},{"key":"17_CR6","doi-asserted-by":"crossref","first-page":"1134","DOI":"10.1145\/1968.1972","volume":"27.11","author":"L.G. Valiant","year":"1984","unstructured":"L.G. Valiant, A Theory of the Learnable, Communications ACM27.11 (1984) 1134\u20131142.","journal-title":"Communications ACM"},{"key":"17_CR7","volume-title":"The Complexity of Boolean Functions","author":"I. Wegener","year":"1987","unstructured":"I. Wegener, The Complexity of Boolean Functions, (B.G. Teubner, Stuttgart, and J. Wiley, New York, 1987)."}],"container-title":["Lecture Notes in Computer Science","CSL '89"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-52753-2_45.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:09:19Z","timestamp":1619572159000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-52753-2_45"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990]]},"ISBN":["9783540527534","9783540471370"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/3-540-52753-2_45","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1990]]}}}