{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,1,25]],"date-time":"2024-01-25T14:25:08Z","timestamp":1706192708206},"reference-count":12,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1992,3,1]],"date-time":"1992-03-01T00:00:00Z","timestamp":699408000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1992,3]]},"DOI":"10.1016\/0020-0190(92)90184-w","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:38:59Z","timestamp":1027654739000},"page":"221-226","source":"Crossref","is-referenced-by-count":21,"title":["A simple lower bound for monotone clique using a communication game"],"prefix":"10.1016","volume":"41","author":[{"given":"Mikael","family":"Goldmann","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Johan","family":"H\u00e5stad","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(92)90184-W_BIB1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0168-0072(83)90038-6","article-title":"\u03a311-formulae on finite structures","volume":"24","author":"Ajtai","year":"1983","journal-title":"Ann. Pure Appl. Logic"},{"key":"10.1016\/0020-0190(92)90184-W_BIB2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02579196","article-title":"The monotone circuit complexity of boolean functions","volume":"7","author":"Alon","year":"1987","journal-title":"Combinatorica"},{"key":"10.1016\/0020-0190(92)90184-W_BIB3","first-page":"1033","article-title":"On a method for obtaining lower bounds for the complexity of individual monotone functions","volume":"282","author":"Andreev","year":"1985","journal-title":"Dokl. Akad. Nauk. SSSR"},{"key":"10.1016\/0020-0190(92)90184-W_BIB4","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1007\/BF01744431","article-title":"Parity circuits, and the polynomial time hierarchy","volume":"17","author":"Furst","year":"1984","journal-title":"Math. Systems Theory"},{"key":"10.1016\/0020-0190(92)90184-W_BIB5","series-title":"Computational Limitations of Small-Depth Circuits","author":"H\u00e5stad","year":"1986"},{"key":"10.1016\/0020-0190(92)90184-W_BIB6","article-title":"Monotone circuits for connectivity require superlogarithmic depth","author":"Karchmer","year":"1988","journal-title":"Proc. 20th Ann. ACM Symp. on Theory of Computing"},{"key":"10.1016\/0020-0190(92)90184-W_BIB7","doi-asserted-by":"crossref","first-page":"562","DOI":"10.1109\/SFCS.1989.63535","article-title":"Probabilistic communication complexity of boolean relations","author":"Raz","year":"1989","journal-title":"Proc. 30th Ann. IEEE Symp. on Foundations of Computer Science"},{"key":"10.1016\/0020-0190(92)90184-W_BIB8","first-page":"287","article-title":"Monotone circuits for matching require linear depth","author":"Raz","year":"1990","journal-title":"Proc. 22nd Ann. ACM Symp. on Theory of Computing"},{"key":"10.1016\/0020-0190(92)90184-W_BIB9","first-page":"887","article-title":"Lower bounds on monotone network complexity of the logical permanent","volume":"37","author":"Razborov","year":"1985","journal-title":"Mat. Zametki"},{"key":"10.1016\/0020-0190(92)90184-W_BIB10","doi-asserted-by":"crossref","first-page":"598","DOI":"10.1007\/BF01137685","article-title":"Lower bounds on the size of bounded-depth networks over a complete basis with logical addition","volume":"41","author":"Razborov","year":"1987","journal-title":"Math. Notes"},{"key":"10.1016\/0020-0190(92)90184-W_BIB11","first-page":"77","article-title":"Algebraic methods in the theory of lower bounds for boolean circuit complexity","author":"Smolensky","year":"1987","journal-title":"Proc. 19th Ann. ACM Symp. on Theory of Computing"},{"key":"10.1016\/0020-0190(92)90184-W_BIB12","first-page":"1","article-title":"Separating the polynomial-time hierarchy by oracles","author":"Yao","year":"1985","journal-title":"Proc. 26th Ann. IEEE Symp. on Foundations of Computer Science"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909290184W?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909290184W?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T08:26:27Z","timestamp":1555143987000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002001909290184W"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,3]]},"references-count":12,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1992,3]]}},"alternative-id":["002001909290184W"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(92)90184-w","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1992,3]]}}}