{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T22:10:45Z","timestamp":1648851045620},"reference-count":30,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1991,12,1]],"date-time":"1991-12-01T00:00:00Z","timestamp":691545600000},"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":7899,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information and Computation"],"published-print":{"date-parts":[[1991,12]]},"DOI":"10.1016\/0890-5401(91)90041-y","type":"journal-article","created":{"date-parts":[[2004,12,16]],"date-time":"2004-12-16T20:34:26Z","timestamp":1103229266000},"page":"117-128","source":"Crossref","is-referenced-by-count":4,"title":["Nonlinear lower bounds on the number of processors of circuits with sublinear separators"],"prefix":"10.1016","volume":"95","author":[{"given":"Juraj","family":"Hromkovi\u010d","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0890-5401(91)90041-Y_BIB1","series-title":"Proceedings, 15th ACM STOC","first-page":"133","article-title":"On notions of information transfer in VLSI circuits","author":"Aho","year":"1983"},{"key":"10.1016\/0890-5401(91)90041-Y_BIB2","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/BF02579166","article-title":"Eigenvalues and expanders","volume":"6","author":"Alon","year":"1986","journal-title":"Combinatorica"},{"key":"10.1016\/0890-5401(91)90041-Y_BIB3","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\/0890-5401(91)90041-Y_BIB4","series-title":"Proceedings of the International Symposium on Combinatorial Theory","first-page":"2","article-title":"Complexity made simple","author":"Harper","year":"1973"},{"issue":"2","key":"10.1016\/0890-5401(91)90041-Y_BIB5","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/0304-3975(75)90018-3","article-title":"A class of Boolean functions with linear combinatorial complexity","volume":"1","author":"Harper","year":"1975","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0890-5401(91)90041-Y_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\/0890-5401(91)90041-Y_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":"Comput. Artificial Intelligence"},{"issue":"3","key":"10.1016\/0890-5401(91)90041-Y_BIB8","first-page":"209","article-title":"Some complexity aspects of VLSI computations. Part 6. Communication complexity","volume":"8","author":"Hromkovi\u010d","year":"1989","journal-title":"Comput. Artificial Intelligence"},{"key":"10.1016\/0890-5401(91)90041-Y_BIB30","unstructured":"Kumi\u010d\u00e1kov\u00e1-Jir\u00e1skov\u00e1, G., Chomsky hierarchy and communication complexity, J. Inform. Process. Cybernet. 25 (4), 157\u2013164."},{"issue":"4","key":"10.1016\/0890-5401(91)90041-Y_BIB9","first-page":"44","article-title":"Bounds on complexity of some classes of functions","author":"Kloss","year":"1965","journal-title":"Vestnik. Moskov. Univ. Ser. I Mat. Mech."},{"issue":"2","key":"10.1016\/0890-5401(91)90041-Y_BIB10","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1137\/0136016","article-title":"A separator theorem for planar graphs","volume":"36","author":"Lipton","year":"1979","journal-title":"SIAM J. Appl. Math."},{"key":"10.1016\/0890-5401(91)90041-Y_BIB11","doi-asserted-by":"crossref","first-page":"615","DOI":"10.1137\/0209046","article-title":"Applications of a planar separator theorem","volume":"9","author":"Lipton","year":"1980","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0890-5401(91)90041-Y_BIB12","series-title":"Mathematical Problems in Computation Theory","first-page":"501","article-title":"On a approach to a bound on the area complexity of combinational circuits","author":"Lo\u017ekin","year":"1988"},{"key":"10.1016\/0890-5401(91)90041-Y_BIB13","first-page":"120","article-title":"Ob odnom metode sinteza skhem","volume":"1","author":"Lupanov","year":"1958","journal-title":"Izv. Vyssh. Uchebn. Zaved."},{"key":"10.1016\/0890-5401(91)90041-Y_BIB14","series-title":"Proceedings, 2nd STACS'85","first-page":"219","article-title":"On the planar monotone computation of threshold functions","volume":"Vol. 182","author":"McColl","year":"1985"},{"key":"10.1016\/0890-5401(91)90041-Y_BIB15","series-title":"Proceedings, 2nd STACS'85","first-page":"231","article-title":"Planar circuits have short specifications","author":"McColl","year":"1985"},{"key":"10.1016\/0890-5401(91)90041-Y_BIB16","author":"McColl","year":"1984"},{"key":"10.1016\/0890-5401(91)90041-Y_BIB17","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\/0890-5401(91)90041-Y_BIB18","doi-asserted-by":"crossref","first-page":"260","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\/0890-5401(91)90041-Y_BIB19","first-page":"181","article-title":"Proof of minimality of circuits consisting of functional elements","volume":"38","author":"Re\u010fkin","year":"1981","journal-title":"Problemy Kibernet."},{"key":"10.1016\/0890-5401(91)90041-Y_BIB20","series-title":"VLSI Systems and Computing","article-title":"Planar circuit complexity and the performance of VLSI algorithms","author":"Savage","year":"1981"},{"key":"10.1016\/0890-5401(91)90041-Y_BIB21","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1007\/BF02246615","article-title":"Zwei lineare untere Schranken f\u00fcr die Komplexit\u00e4t Boolescher Funktionen","volume":"13","author":"Schnorr","year":"1974","journal-title":"Computing"},{"key":"10.1016\/0890-5401(91)90041-Y_BIB22","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/0304-3975(80)90074-2","article-title":"A 3 \u00b7 n lower bound on the network complexity of Boolean functions","volume":"10","author":"Schnorr","year":"1980","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0890-5401(91)90041-Y_BIB23","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1002\/j.1538-7305.1949.tb03624.x","article-title":"The synthesis of two-terminal switching circuits","volume":"28","author":"Shannon","year":"1949","journal-title":"Bell System Tech. J."},{"key":"10.1016\/0890-5401(91)90041-Y_BIB24","first-page":"117","article-title":"Minimal realizations of functions by circuits using functional elements","volume":"15","author":"Soprunenko","year":"1965","journal-title":"Problemy Kibernet."},{"key":"10.1016\/0890-5401(91)90041-Y_BIB25","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1007\/BF01683282","article-title":"On the combinatorial complexity of certain symmetric Boolean functions","volume":"10","author":"Stokmeyer","year":"1977","journal-title":"Math. System Theory"},{"key":"10.1016\/0890-5401(91)90041-Y_BIB26","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1016\/0020-0190(89)90172-5","article-title":"Lower bounds for synchronous circuits and planar circuits","volume":"130","author":"Tur\u00e1n","year":"1989","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0890-5401(91)90041-Y_BIB27","author":"Ullman","year":"1984"},{"key":"10.1016\/0890-5401(91)90041-Y_BIB28","author":"Wegener","year":"1987"},{"key":"10.1016\/0890-5401(91)90041-Y_BIB29","series-title":"Proceedings, 13th Annual ACM Symposium on Theory of Computing","first-page":"308","article-title":"The entropic limitation of VLSI computations","author":"Yao","year":"1981"}],"container-title":["Information and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:089054019190041Y?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:089054019190041Y?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,31]],"date-time":"2019-01-31T01:25:36Z","timestamp":1548897936000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/089054019190041Y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,12]]},"references-count":30,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1991,12]]}},"alternative-id":["089054019190041Y"],"URL":"https:\/\/doi.org\/10.1016\/0890-5401(91)90041-y","relation":{},"ISSN":["0890-5401"],"issn-type":[{"value":"0890-5401","type":"print"}],"subject":[],"published":{"date-parts":[[1991,12]]}}}