{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,12,19]],"date-time":"2024-12-19T05:30:35Z","timestamp":1734586235065,"version":"3.30.2"},"reference-count":9,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1981,6,1]],"date-time":"1981-06-01T00:00:00Z","timestamp":360201600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Acta Informatica"],"published-print":{"date-parts":[[1981,6]]},"DOI":"10.1007\/bf00289267","type":"journal-article","created":{"date-parts":[[2004,10,5]],"date-time":"2004-10-05T03:39:42Z","timestamp":1096947582000},"page":"303-307","source":"Crossref","is-referenced-by-count":12,"title":["The equivalence of Horn and network complexity for Boolean functions"],"prefix":"10.1007","volume":"15","author":[{"given":"Stal O.","family":"Anderaa","sequence":"first","affiliation":[]},{"given":"Egon","family":"B\ufffdrger","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"CR1","first-page":"1","volume-title":"Proc. of the Second Scand. Log. Symp.","author":"A.O. Aanderaa","year":"1971","unstructured":"Aanderaa, A.O.: On the decision problem for formulas in which all disjunctions are binary. Proc. of the Second Scand. Log. Symp. Amsterdam: North Holland pp. 1?18 (1971)"},{"key":"CR2","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1007\/BF02025119","volume":"16","author":"E. B\u00f6rger","year":"1974","unstructured":"B\u00f6rger, E.: Reduktionstypen in Krom- und Hornformeln. Dissertation, M\u00fcnster. Arch. Math. Logik Grundlagenforsch. 16, 67?84 (1974)","journal-title":"Dissertation, M\u00fcnster. Arch. Math. Logik Grundlagenforsch."},{"key":"CR3","doi-asserted-by":"crossref","unstructured":"Cook, S.A.: The complexity of theorem proving procedure. Conf. Rec. of 3rd ACM Symp. on Theory of Computing 151?158 (1970)","DOI":"10.1145\/800157.805047"},{"key":"CR4","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1016\/0304-3975(76)90068-2","volume":"3","author":"N.D. Jones","year":"1977","unstructured":"Jones, N.D., Laaser, W.T.: Complete problems for deterministic polynomial time. Theor. Comput. Sci. 3, 105?117 (1977)","journal-title":"Theor. Comput. Sci."},{"key":"CR5","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-322-94701-7","volume-title":"Rekursive Funktionen und ihre Komplexit\u00e4t","author":"C.P. Schnorr","year":"1974","unstructured":"Schnorr, C.P.: Rekursive Funktionen und ihre Komplexit\u00e4t. Stuttgart: Teubner (1974)"},{"key":"CR6","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1007\/BF00265223","volume":"7","author":"C.P. Schnorr","year":"1976","unstructured":"Schnorr, C.P.: The network complexity and the Turing machine complexity of finite functions. Acta Informat. 7, 95?107 (1976)","journal-title":"Acta Informat."},{"key":"CR7","volume-title":"Logic Colloquium 76","author":"C.P. Schnorr","year":"1977","unstructured":"Schnorr, C.P.: The network complexity and the breadth of Boolean functions. In: (R.O. Gandy, J.M.E. Hyland, Eds.): Logic Colloquium 76. Amsterdam: North Holland. 1977"},{"key":"CR8","volume-title":"Mathematical logic","author":"J.R. Shoenfield","year":"1967","unstructured":"Shoenfield, J.R.: Mathematical logic. Reading, MA: Addison-Wesley, 1967"},{"key":"CR9","series-title":"Lecture Notes in Computer Science, Vol. 43","volume-title":"Komplexit\u00e4t von Entscheidungsproblemen","year":"1976","unstructured":"Specker, E., Strassen, V. (Hrsg.): Komplexit\u00e4t von Entscheidungsproblemen. Lecture Notes in Computer Science, Vol. 43. Berlin Heidelberg New York: Springer, 1976"}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00289267.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF00289267\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00289267","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,18]],"date-time":"2024-12-18T21:34:29Z","timestamp":1734557669000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF00289267"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1981,6]]},"references-count":9,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1981,6]]}},"alternative-id":["BF00289267"],"URL":"https:\/\/doi.org\/10.1007\/bf00289267","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"type":"print","value":"0001-5903"},{"type":"electronic","value":"1432-0525"}],"subject":[],"published":{"date-parts":[[1981,6]]}}}