乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,4,16]],"date-time":"2024-04-16T16:54:23Z","timestamp":1713286463362},"reference-count":22,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1992,4,1]],"date-time":"1992-04-01T00:00:00Z","timestamp":702086400000},"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":7777,"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":[[1992,4]]},"DOI":"10.1016\/0304-3975(92)90079-u","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:47:37Z","timestamp":1027640857000},"page":"285-300","source":"Crossref","is-referenced-by-count":5,"title":["Lower bounds on the area complexity of Boolean circuits"],"prefix":"10.1016","volume":"97","author":[{"given":"Juraj","family":"Hromkovi\u010d","sequence":"first","affiliation":[]},{"given":"Sergej A.","family":"Lo\u017ekin","sequence":"additional","affiliation":[]},{"given":"Andrej I.","family":"Rybko","sequence":"additional","affiliation":[]},{"given":"Alexander A.","family":"Sapo\u017eenko","sequence":"additional","affiliation":[]},{"given":"Nade\u017eda A.","family":"\u0160kalikova","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(92)90079-U_BIB1","series-title":"Proc. 15th ACM STOC","first-page":"133","article-title":"On notions of information transfer in VLSI circuits","author":"Aho","year":"1983"},{"key":"10.1016\/0304-3975(92)90079-U_BIB2","first-page":"209","article-title":"On circuits of lattice elements","volume":"33","author":"Albrecht","year":"1978","journal-title":"Problemy kibernetiky"},{"key":"10.1016\/0304-3975(92)90079-U_BIB3","series-title":"Sect. Math.","first-page":"36","article-title":"Komplexit\u00e4tstheoretische Aspecte des Antwurfs von VLSI-Systemen","author":"Albrecht","year":"1982"},{"key":"10.1016\/0304-3975(92)90079-U_BIB4","doi-asserted-by":"crossref","first-page":"447","DOI":"10.1007\/BF00292113","article-title":"A result on k-valent graphs and its application to a graph embedding problem","volume":"24","author":"Dunne","year":"1987","journal-title":"Acta Inform."},{"issue":"2","key":"10.1016\/0304-3975(92)90079-U_BIB5","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1016\/0020-0190(85)90035-3","article-title":"Linear lower bounds on unbounded fan-in Boolean circuits","volume":"21","author":"Hromkovi\u010d","year":"1985","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0304-3975(92)90079-U_BIB6","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/0304-3975(88)90165-X","article-title":"The advantages of a new approach to defining the communication complexity for VLSI","volume":"57","author":"Hromkovi\u010d","year":"1988","journal-title":"Theoret. Comput. Sci."},{"issue":"3","key":"10.1016\/0304-3975(92)90079-U_BIB7","first-page":"229","article-title":"Some complexity aspects of VLSI computations, Part 1. A framework for the study of information transfer in VLSI circuits","volume":"7","author":"Hromkovi\u010d","year":"1988","journal-title":"Computers and Artificial Intelligence"},{"key":"10.1016\/0304-3975(92)90079-U_BIB8","first-page":"397","article-title":"The VLSI complexity of Boolean functions","volume":"Vol. 171","author":"Kramer","year":"1983"},{"key":"10.1016\/0304-3975(92)90079-U_BIB9","first-page":"274","article-title":"On the realization of switching functions in a class of circuits of lattice","volume":"19","author":"Kravcov","year":"1967","journal-title":"Problemy kibernetiki"},{"key":"10.1016\/0304-3975(92)90079-U_BIB10","first-page":"63","article-title":"On the synthesis of some classes of control system","volume":"10","author":"Lupanov","year":"1963","journal-title":"Problemy kibernetiki"},{"key":"10.1016\/0304-3975(92)90079-U_BIB11","first-page":"219","article-title":"On the planar monotone computation of threshold functions","volume":"Vol. 182","author":"McColl","year":"1985"},{"key":"10.1016\/0304-3975(92)90079-U_BIB12","first-page":"231","article-title":"Planar circuits have short specifications","volume":"Vol. 182","author":"McColl","year":"1985"},{"key":"10.1016\/0304-3975(92)90079-U_BIB13","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/0020-0190(87)90180-3","article-title":"The planar realization of Boolean functions","volume":"24","author":"McColl","year":"1987","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0304-3975(92)90079-U_BIB14","series-title":"The complexity of Boolean functions","author":"Nigmatullin","year":"1983"},{"issue":"2","key":"10.1016\/0304-3975(92)90079-U_BIB15","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1016\/0022-0000(84)90069-2","article-title":"Communication complexity","volume":"28","author":"Papadimitriou","year":"1984","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(92)90079-U_BIB16","series-title":"The Complexity of Computing","author":"Savage","year":"1976"},{"key":"10.1016\/0304-3975(92)90079-U_BIB17","first-page":"102","article-title":"On the complexity of the realization of some functions by lattice circuits","volume":"1","author":"\u0160kalikova","year":"1976","journal-title":"Sbornik rabot po matemati\u010deskoj kibernetike"},{"key":"10.1016\/0304-3975(92)90079-U_BIB18","first-page":"87","article-title":"On the relation between the area complexity and space complexity of Boolean circuits","volume":"38","author":"\u0160kalikova","year":"1982","journal-title":"Metody diskretnogo analiza v ocenkach zlo\u017enosti upravljaju\u0161\u010dich sistem"},{"key":"10.1016\/0304-3975(92)90079-U_BIB19","series-title":"Ph.D. Dissertation","article-title":"A complexity theory for VLSI","author":"Thompson","year":"1980"},{"key":"10.1016\/0304-3975(92)90079-U_BIB20","first-page":"495","article-title":"Computational Aspects of VLSI","author":"Ullman","year":"1984"},{"key":"10.1016\/0304-3975(92)90079-U_BIB21","series-title":"Wiley-Teubner Series in Computer Science","article-title":"The Complexity of Boolean Functions","author":"Wegener","year":"1987"},{"key":"10.1016\/0304-3975(92)90079-U_BIB22","series-title":"Proc. 11th Annual ACM STOC","first-page":"294","article-title":"Some complexity questions related to distributed computing","author":"Yao","year":"1980"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759290079U?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759290079U?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T23:57:53Z","timestamp":1555113473000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439759290079U"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,4]]},"references-count":22,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1992,4]]}},"alternative-id":["030439759290079U"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(92)90079-u","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1992,4]]}}}