{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,11]],"date-time":"2023-01-11T03:12:25Z","timestamp":1673406745529},"reference-count":18,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1990,11,1]],"date-time":"1990-11-01T00:00:00Z","timestamp":657417600000},"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":8294,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1990,11]]},"DOI":"10.1016\/0166-218x(90)90079-r","type":"journal-article","created":{"date-parts":[[2002,10,11]],"date-time":"2002-10-11T08:43:22Z","timestamp":1034325802000},"page":"3-20","source":"Crossref","is-referenced-by-count":6,"title":["Lower bounds for recognizing small cliques on CRCW PRAM's"],"prefix":"10.1016","volume":"29","author":[{"given":"Paul","family":"Beame","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(90)90079-R_BIB1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0168-0072(83)90038-6","article-title":"\u221111-formulae on finite structures","volume":"24","author":"Ajtai","year":"1983","journal-title":"Ann. Pure Appl. Logic"},{"issue":"3","key":"10.1016\/0166-218X(90)90079-R_BIB2","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/0168-0072(89)90036-5","article-title":"First-order definability on finite structures","volume":"45","author":"Ajtai","year":"1989","journal-title":"Ann. Pure Appl. Logic"},{"key":"10.1016\/0166-218X(90)90079-R_BIB3","series-title":"Proceedings 16th ACM-STOC","first-page":"471","article-title":"A theorem on probabilistic constant depth computations","author":"Ajtai","year":"1984"},{"key":"10.1016\/0166-218X(90)90079-R_BIB4","author":"Babai","year":"1984","journal-title":"Private communication"},{"key":"10.1016\/0166-218X(90)90079-R_BIB5","series-title":"Ph.D. Thesis","article-title":"Lower bounds in parallel machine computation","author":"Beame","year":"1986"},{"issue":"1","key":"10.1016\/0166-218X(90)90079-R_BIB6","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1016\/0890-5401(88)90040-5","article-title":"Limits on the power of concurrent-write parallel machines","volume":"76","author":"Beame","year":"1988","journal-title":"Inform. and Comput."},{"issue":"3","key":"10.1016\/0166-218X(90)90079-R_BIB7","doi-asserted-by":"crossref","first-page":"643","DOI":"10.1145\/65950.65958","article-title":"Optimal bounds for decision problems on the CRCW PRAM","volume":"36","author":"Beame","year":"1989","journal-title":"J. ACM"},{"key":"10.1016\/0166-218X(90)90079-R_BIB8","series-title":"Random Graphs","author":"Bollob\u00e1s","year":"1985"},{"key":"10.1016\/0166-218X(90)90079-R_BIB9","series-title":"Probabilistic Methods in Combinatorics","author":"Erd\u0151os","year":"1974"},{"issue":"1","key":"10.1016\/0166-218X(90)90079-R_BIB10","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\/0166-218X(90)90079-R_BIB11","series-title":"Proceedings 18th ACM-STOC","first-page":"6","article-title":"Almost optimal lower bounds for small depth circuits","author":"Hastad","year":"1986"},{"key":"10.1016\/0166-218X(90)90079-R_BIB12","series-title":"Computational Limitations for Small Depth Circuits","author":"Hastad","year":"1987"},{"key":"10.1016\/0166-218X(90)90079-R_BIB13","first-page":"234","article-title":"A depth-size tradeoff for Boolean circuits with unbounded fan-in","volume":"223","author":"Lynch","year":"1986"},{"issue":"4","key":"10.1016\/0166-218X(90)90079-R_BIB14","first-page":"333","article-title":"Lower bounds on the size of bounded depth circuits over a complete basis with logical addition","volume":"41","author":"Razborov","year":"1987","journal-title":"Math. Notes Acad. Sci. U.S.S.R."},{"key":"10.1016\/0166-218X(90)90079-R_BIB15","series-title":"Proceedings 15th ACM-STOC","first-page":"61","article-title":"Borel sets and circuit complexity","author":"Sipser","year":"1983"},{"key":"10.1016\/0166-218X(90)90079-R_BIB16","series-title":"Proceedings 19th ACM-STOC","first-page":"77","article-title":"Algebraic methods in the theory of lower bounds for Boolean circuit complexity","author":"Smolensky","year":"1987"},{"issue":"2","key":"10.1016\/0166-218X(90)90079-R_BIB17","doi-asserted-by":"crossref","first-page":"404","DOI":"10.1137\/0213027","article-title":"Simulation of parallel random access machines by circuits","volume":"13","author":"Stockmeyer","year":"1984","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0166-218X(90)90079-R_BIB18","series-title":"Proceedings 26th IEEE-FOCS","first-page":"1","article-title":"Separating the polynomial-time hierarchy by oracles: Part I","author":"Yao","year":"1985"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9090079R?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9090079R?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,11]],"date-time":"2019-04-11T02:51:16Z","timestamp":1554951076000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X9090079R"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,11]]},"references-count":18,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1990,11]]}},"alternative-id":["0166218X9090079R"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(90)90079-r","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1990,11]]}}}