{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T00:06:18Z","timestamp":1648771578847},"reference-count":12,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1987,1,1]],"date-time":"1987-01-01T00:00:00Z","timestamp":536457600000},"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":9694,"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":[[1987]]},"DOI":"10.1016\/0304-3975(87)90110-1","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T00:17:21Z","timestamp":1027642641000},"page":"239-249","source":"Crossref","is-referenced-by-count":0,"title":["Models of lower-bounds proofs"],"prefix":"10.1016","volume":"52","author":[{"given":"R.G.","family":"Nigmatullin","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(87)90110-1_BIB1","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1016\/0304-3975(83)90029-4","article-title":"A Boolean function requiring 3n network size","volume":"28","author":"Blum","year":"1984","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(87)90110-1_BIB2","first-page":"44","article-title":"Bounds on complexity of some classes of functions","volume":"4","author":"Kloss","year":"1965","journal-title":"Vestnik MGU, Se.. Mat. Mech."},{"key":"10.1016\/0304-3975(87)90110-1_BIB3","series-title":"The Complexity of Boolean Functions","author":"Nigmatullin","year":"1983"},{"key":"10.1016\/0304-3975(87)90110-1_BIB4","first-page":"10","article-title":"The complexity of universal functions and lower bounds on the complexity","volume":"11","author":"Nigmatullin","year":"1984","journal-title":"Izvestija Vuz Matematika"},{"key":"10.1016\/0304-3975(87)90110-1_BIB5","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1007\/BFb0028817","article-title":"Are lower bounds on the complexity lower bounds for universal functions?","volume":"199","author":"Nigmatullin","year":"1985","journal-title":"Lecture Notes in Computer Science"},{"key":"10.1016\/0304-3975(87)90110-1_BIB6","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1137\/0206030","article-title":"A 2.5n-lower bound on the combinational complexity of Boolean functions","volume":"6","author":"Paul","year":"1977","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(87)90110-1_BIB7","first-page":"83","article-title":"Proof of minimality of some circuits","volume":"23","author":"Redkin","year":"1970","journal-title":"Problemy kibern."},{"key":"10.1016\/0304-3975(87)90110-1_BIB8","series-title":"The Complexity of Computing","author":"Savage","year":"1976"},{"key":"10.1016\/0304-3975(87)90110-1_BIB9","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1016\/0304-3975(76)90073-6","article-title":"The combinational complexity of equivalence","volume":"1","author":"Schnoor","year":"1976","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(87)90110-1_BIB10","first-page":"125","article-title":"The equivalence problem for regular expressions with squaring requires exponential space","author":"Stockmeyer","year":"1972","journal-title":"Proc. 13th Ann. IEEE Symp. on Switching and Automata Theory"},{"key":"10.1016\/0304-3975(87)90110-1_BIB11","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1007\/BF01683282","article-title":"On the combinational complexity of certain symmetric Boolean functions","volume":"10","author":"Stockmeyer","year":"1977","journal-title":"Math. Systems Theory"},{"key":"10.1016\/0304-3975(87)90110-1_BIB12","first-page":"196","article-title":"Universal circuits","author":"Valiant","year":"1976","journal-title":"Proc. 8th ACM Symp. on Theory of Computing"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397587901101?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397587901101?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:55:56Z","timestamp":1555062956000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397587901101"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987]]},"references-count":12,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1987]]}},"alternative-id":["0304397587901101"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(87)90110-1","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1987]]}}}