{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T06:01:56Z","timestamp":1775282516030,"version":"3.50.1"},"reference-count":4,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1992,12,1]],"date-time":"1992-12-01T00:00:00Z","timestamp":723168000000},"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":7533,"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,12]]},"DOI":"10.1016\/0304-3975(92)90260-m","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:47:37Z","timestamp":1027655257000},"page":"385-390","source":"Crossref","is-referenced-by-count":280,"title":["On the distributional complexity of disjointness"],"prefix":"10.1016","volume":"106","author":[{"given":"A.A.","family":"Razborov","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(92)90260-M_BIB1","first-page":"337","article-title":"Complexity classes in communication complexity Theory","author":"Babai","year":"1986","journal-title":"Proc. 27th IEEE FOCS"},{"key":"10.1016\/0304-3975(92)90260-M_BIB2","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1109\/PSCT.1987.10319253","article-title":"The probabilistic communication complexity of set intersection","author":"Kalyanasundaram","year":"1987","journal-title":"Proc. 2nd Ann. Conf. on Structure in Complexity Theory"},{"key":"10.1016\/0304-3975(92)90260-M_BIB3","first-page":"209","article-title":"Some complexity questions related to distributed computing","author":"Yao","year":"1979","journal-title":"Proc. 11th ACM STOC"},{"key":"10.1016\/0304-3975(92)90260-M_BIB4","first-page":"420","article-title":"Lower bounds by probabilistic arguments","author":"Yao","year":"1983","journal-title":"Proc. 24th IEEE FOCS"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759290260M?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759290260M?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,1,2]],"date-time":"2024-01-02T15:10:05Z","timestamp":1704208205000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439759290260M"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,12]]},"references-count":4,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1992,12]]}},"alternative-id":["030439759290260M"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(92)90260-m","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1992,12]]}}}