{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,12,20]],"date-time":"2023-12-20T14:55:33Z","timestamp":1703084133800},"reference-count":7,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1985,6,1]],"date-time":"1985-06-01T00:00:00Z","timestamp":486432000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1985,6,1]],"date-time":"1985-06-01T00:00:00Z","timestamp":486432000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Acta Informatica"],"published-print":{"date-parts":[[1985,6]]},"DOI":"10.1007\/bf00264232","type":"journal-article","created":{"date-parts":[[2004,9,27]],"date-time":"2004-09-27T17:17:22Z","timestamp":1096305442000},"page":"229-240","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["A 2.5n lower bound on the monotone network complexity of T3n"],"prefix":"10.1007","volume":"22","author":[{"given":"Paul E.","family":"Dunne","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[1985,6,1]]},"reference":[{"key":"BF00264232_CR1","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1016\/0304-3975(83)90029-4","volume":"28","author":"N. Blum","year":"1984","unstructured":"Blum, N.: A Boolean Function Requiring 3n Network Size. Theor. Comput. Sci. 28, 337\u2013345 (1984)","journal-title":"Theor. Comput. Sci."},{"key":"BF00264232_CR2","unstructured":"Bloniarz, P.: The Complexity of Monotone Boolean Functions and an Algorithm for Finding Shortest Paths in a Graph. Ph.D. Dissertation, Techn. Rep. No. 238. Lab. Comput. Sci M.I.T (January 1979)"},{"key":"BF00264232_CR3","unstructured":"Dunne, P.E.: Lower Bounds on the Monotone Network Complexity of Threshold Functions. In: Proceedings of 22nd Annual Allerton Conf. On Communication, Control and Computing, pp. 911\u2013920 (October 1984)"},{"key":"BF00264232_CR4","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/BF02241983","volume":"16","author":"K. Mehlhorn","year":"1976","unstructured":"Mehlhorn, K., Galil, Z.: Monotone Switching Networks and Boolean Matrix Product. Computing 16, 99\u2013111 (1976)","journal-title":"Computing"},{"key":"BF00264232_CR5","unstructured":"Paterson, M.S.: An Introduction to Boolean Function Complexity. Tech. Rep. Dept. Comput. Sci., Stanford, STAN-CS-76-557 (1976)"},{"key":"BF00264232_CR6","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1016\/0020-0190(84)90111-X","volume":"18","author":"J. Tiekenheinrich","year":"1984","unstructured":"Tiekenheinrich, J.: A 4n-Lower Bound on the Monotone Network Complexity of a One-Output Boolean Function. Inf. Process. Lett. 18, 201\u2013202 (1984)","journal-title":"Inf. Process. Lett."},{"key":"BF00264232_CR7","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1016\/0304-3975(89)90084-4","volume":"21","author":"I. Wegener","year":"1982","unstructured":"Wegener, I.: Boolean Functions Whose Monotone Complexity is of Size n2\/log n. Theor. Comput. Sci. 21, 213\u2013224 (1982)","journal-title":"Theor. Comput. Sci."}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00264232.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/BF00264232\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00264232","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00264232.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,11]],"date-time":"2023-04-11T08:06:36Z","timestamp":1681200396000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/BF00264232"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,6]]},"references-count":7,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1985,6]]}},"alternative-id":["BF00264232"],"URL":"https:\/\/doi.org\/10.1007\/bf00264232","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"value":"0001-5903","type":"print"},{"value":"1432-0525","type":"electronic"}],"subject":[],"published":{"date-parts":[[1985,6]]},"assertion":[{"value":"4 February 1985","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 June 1985","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}