{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,3]],"date-time":"2025-11-03T13:06:08Z","timestamp":1762175168171},"reference-count":13,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2000,3,1]],"date-time":"2000-03-01T00:00:00Z","timestamp":951868800000},"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":4886,"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":[[2000,3]]},"DOI":"10.1016\/s0304-3975(99)00184-x","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T13:48:11Z","timestamp":1027604891000},"page":"59-70","source":"Crossref","is-referenced-by-count":11,"title":["New applications of the incompressibility method: Part II"],"prefix":"10.1016","volume":"235","author":[{"given":"Harry","family":"Buhrman","sequence":"first","affiliation":[]},{"given":"Tao","family":"Jiang","sequence":"additional","affiliation":[]},{"given":"Ming","family":"Li","sequence":"additional","affiliation":[]},{"given":"Paul","family":"Vit\u00e1nyi","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(99)00184-X_BIB1","doi-asserted-by":"crossref","unstructured":"L. Alexanderson, L.F. Klosinski, L.C. Larson, The William Lowell Putnam Mathematical Competition, Problems and Solutions, Mathematical Association of America, Washington, DC, 1985, pp. 1965\u20131984.","DOI":"10.1090\/prb\/030"},{"key":"10.1016\/S0304-3975(99)00184-X_BIB2","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1016\/0020-0190(93)90135-V","article-title":"Determining the majority","volume":"47","author":"Alonso","year":"1993","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0304-3975(99)00184-X_BIB3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1137\/S0097539794275914","article-title":"The average-case complexity of determining the majority","volume":"26-1","author":"Alonso","year":"1997","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0304-3975(99)00184-X_BIB4","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/0096-3003(93)90037-F","article-title":"On the number of N-bit strings with maximum complexity","volume":"59","author":"Chaitin","year":"1993","journal-title":"Appl. Math. Comput."},{"key":"10.1016\/S0304-3975(99)00184-X_BIB5","doi-asserted-by":"crossref","unstructured":"D. Coppersmith, S. Winograd, Matrix multiplication via arithmetic progressions, Proc. 19th ACM Symp. on Theory of Computing, 1987, pp. 1\u20136.","DOI":"10.1145\/28395.28396"},{"key":"10.1016\/S0304-3975(99)00184-X_BIB6","doi-asserted-by":"crossref","unstructured":"D.H. Greene, D.E. Knuth, Mathematics for the Analysis of Algorithms, 3rd ed., Birkh\u00e4user, Boston, MA, 1990.","DOI":"10.1007\/978-0-8176-4729-2"},{"key":"10.1016\/S0304-3975(99)00184-X_BIB7","first-page":"287","volume":"42","author":"Jiang","year":"1999","journal-title":"New applications of the incompressibility method. Computer Journal"},{"key":"10.1016\/S0304-3975(99)00184-X_BIB8","series-title":"An Introduction to Kolmogorov Complexity and its Applications","author":"Li","year":"1997"},{"key":"10.1016\/S0304-3975(99)00184-X_BIB9","unstructured":"M. Li, P.M.B. Vit\u00e1nyi, Kolmogorov complexity arguments in combinatorics, J. Combin. Theory Ser. A 66(2) (1994) 226\u2013236. Errata, J. Combin. Theory Ser. A 69 (1995) 183."},{"issue":"1","key":"10.1016\/S0304-3975(99)00184-X_BIB10","first-page":"1","article-title":"Three approaches to the quantitative definition of information","volume":"1","author":"Kolmogorov","year":"1965","journal-title":"Problems Inform. Transmission"},{"key":"10.1016\/S0304-3975(99)00184-X_BIB11","series-title":"Communication Complexity","author":"Kushilevitz","year":"1997"},{"key":"10.1016\/S0304-3975(99)00184-X_BIB12","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1016\/S0019-9958(73)90228-3","article-title":"A fast expected time algorithm for boolean matrix multiplication and transitive closure","volume":"22","author":"O'Neil","year":"1973","journal-title":"Inform. and Control"},{"key":"10.1016\/S0304-3975(99)00184-X_BIB13","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1007\/BF01275672","article-title":"On computing majority by comparisons","volume":"11","author":"Saks","year":"1991","journal-title":"Combinatorica"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S030439759900184X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S030439759900184X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2021,5,6]],"date-time":"2021-05-06T16:30:17Z","timestamp":1620318617000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S030439759900184X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,3]]},"references-count":13,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2000,3]]}},"alternative-id":["S030439759900184X"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(99)00184-x","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2000,3]]}}}