{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T16:24:35Z","timestamp":1774369475161,"version":"3.50.1"},"reference-count":6,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[1979,11,1]],"date-time":"1979-11-01T00:00:00Z","timestamp":310262400000},"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":[[1979,11]]},"DOI":"10.1007\/bf00268321","type":"journal-article","created":{"date-parts":[[2004,9,30]],"date-time":"2004-09-30T07:48:17Z","timestamp":1096530497000},"page":"371-375","source":"Crossref","is-referenced-by-count":26,"title":["Some remarks on Boolean sums"],"prefix":"10.1007","volume":"12","author":[{"given":"Kurt","family":"Mehlhorn","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"281","DOI":"10.4153\/CMB-1966-036-2","volume":"9","author":"W.G. Brown","year":"1966","unstructured":"Brown, W.G.: On graphs that do not contain a Thompson graph. Can. Math. Bull, 9, 281?285 (1966)","journal-title":"Can. Math. Bull"},{"key":"CR2","doi-asserted-by":"crossref","unstructured":"Lamagna, E.A., Savage, J.E.: Combinatorial complexity of some monotone functions, 15th SWAT Conference, New Orleans, 140?144, 1974","DOI":"10.1109\/SWAT.1974.9"},{"key":"CR3","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1007\/BF02241983","volume":"16","author":"K. Mehlhorn","year":"1976","unstructured":"Mehlhorn, K., Galil, Z.: Monotone switching circuits and Boolean matrix product, Computing 16, 99?111 (1976)","journal-title":"Computing"},{"key":"CR4","first-page":"236","volume":"21","author":"E.I. Neciporuk","year":"1971","unstructured":"Neciporuk, E.I.: On a Boolean matrix, Systems Research Theory, 21, 236?239 (1971)","journal-title":"Systems Research Theory"},{"key":"CR5","unstructured":"Pippenger, N.: On another boolean matrix, IBM Research Report 69\/4, Dec. 1977"},{"key":"CR6","unstructured":"Wegener, I.: A new lower bound on the monotone network complexity of boolean sums, Preprint, Dept. of Mathematics, University of Bielefeld, 1978"}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00268321.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF00268321\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00268321","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,3]],"date-time":"2020-04-03T07:21:51Z","timestamp":1585898511000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF00268321"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1979,11]]},"references-count":6,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1979,11]]}},"alternative-id":["BF00268321"],"URL":"https:\/\/doi.org\/10.1007\/bf00268321","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"value":"0001-5903","type":"print"},{"value":"1432-0525","type":"electronic"}],"subject":[],"published":{"date-parts":[[1979,11]]}}}