{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,12,5]],"date-time":"2022-12-05T19:52:13Z","timestamp":1670269933322},"reference-count":17,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1976,1,1]],"date-time":"1976-01-01T00:00:00Z","timestamp":189302400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":13712,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1976]]},"DOI":"10.1016\/0304-3975(76)90035-9","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T00:17:21Z","timestamp":1027642641000},"page":"249-269","source":"Crossref","is-referenced-by-count":7,"title":["Lower bounds for the size of expressions for certain functions in d-ary logic"],"prefix":"10.1016","volume":"2","author":[{"given":"Bo\u0161tjan","family":"Vilfan","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(76)90035-9_BIB1","series-title":"Principles of Combinatorics","author":"Berge","year":"1971"},{"key":"10.1016\/0304-3975(76)90035-9_BIB2","article-title":"Lower bounds on the size of Boolean formulas","author":"Fischer","year":"1975","journal-title":"7th Annual ACM Symposium on Theory of Computing"},{"key":"10.1016\/0304-3975(76)90035-9_BIB3","series-title":"Combinatorial Theory","author":"Hall","year":"1967"},{"key":"10.1016\/0304-3975(76)90035-9_BIB4","first-page":"6037","article-title":"Nombre minimal de contacts de fermeture necessaires pour r\u00e9aliser une fonction booleenne symetrique de n variables","volume":"258","author":"Hansel","year":"1964","journal-title":"C.R. Acad. Sci. Paris"},{"key":"10.1016\/0304-3975(76)90035-9_BIB5","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1016\/0001-8708(72)90021-7","article-title":"On the complexity of the marriage problem","volume":"9","author":"Harper","year":"1972","journal-title":"Advances in Math."},{"key":"10.1016\/0304-3975(76)90035-9_BIB6","series-title":"Contributions to Mathematical Logic","first-page":"175","article-title":"Lengths of formulas and elimination of quantifiers I","author":"Hodes","year":"1968"},{"key":"10.1016\/0304-3975(76)90035-9_BIB7","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1145\/321574.321587","article-title":"The logical complexity of geometric properties in the plane","volume":"17","author":"Hodes","year":"1970","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(76)90035-9_BIB8","first-page":"752","article-title":"Complexity bounds for the realization of monotone symmetrical functions by means of formulas in the basis v, &,\u0311","volume":"189","author":"Khasin","year":"1969","journal-title":"Dokl. Akad. Nauk SSSR"},{"key":"10.1016\/0304-3975(76)90035-9_BIB9","first-page":"35","article-title":"O slo\u017enosti realizacii line\u01d0no\u01d0 funkcii v klasse \u03c0-shem","volume":"9","author":"Khrap\u010denko","year":"1971","journal-title":"Mat. Zametki"},{"key":"10.1016\/0304-3975(76)90035-9_BIB10","first-page":"83","article-title":"Ob odnom metode polu\u010denija ni\u017enih ocenok slo\u017enosti \u03c0-shem","volume":"10","author":"Khrap\u010denko","year":"1971","journal-title":"Mat. Zametki"},{"key":"10.1016\/0304-3975(76)90035-9_BIB11","first-page":"803","article-title":"Slo\u017enost kontaktnyh shem, realizuju\u0161\u010dih odnu funkciju algebri logiki","volume":"151","author":"Kri\u010devski\u01d0","year":"1963","journal-title":"Dokl. Akad. Nauk SSSR"},{"key":"10.1016\/0304-3975(76)90035-9_BIB12","series-title":"Proc. Sixth Annual Princeton Conference on Information Sciences and Systems","first-page":"208","article-title":"The length of Boolean expressions","author":"Meyer","year":"1972"},{"key":"10.1016\/0304-3975(76)90035-9_BIB13","series-title":"Perceptrons","author":"Minsky","year":"1969"},{"key":"10.1016\/0304-3975(76)90035-9_BIB14","first-page":"765","article-title":"A Boolean function","volume":"169","author":"Ne\u010diporuk","year":"1966","journal-title":"Dokl. Akad. Nauk SSSR"},{"key":"10.1016\/0304-3975(76)90035-9_BIB15","unstructured":"H.J. Ryser, Combinatorial Mathematics, The Carus Mathematical Monographs, 14 (Math. Assoc. of Am., Washington, D.C.)."},{"key":"10.1016\/0304-3975(76)90035-9_BIB16","series-title":"Ph.D. Thesis","article-title":"The complexity of finite functions","author":"Vilfan","year":"1972"},{"key":"10.1016\/0304-3975(76)90035-9_BIB17","series-title":"Automata, Languages, and Programming","first-page":"609","article-title":"A generalization of a theorem of Specker and some applications","author":"Vilfan","year":"1973"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397576900359?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397576900359?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T09:54:10Z","timestamp":1555062850000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397576900359"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1976]]},"references-count":17,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1976]]}},"alternative-id":["0304397576900359"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(76)90035-9","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1976]]}}}