{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,9]],"date-time":"2025-04-09T16:50:20Z","timestamp":1744217420827},"reference-count":21,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1994,10,1]],"date-time":"1994-10-01T00:00:00Z","timestamp":780969600000},"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":6864,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[1994,10]]},"DOI":"10.1016\/s0022-0000(05)80049-2","type":"journal-article","created":{"date-parts":[[2005,8,20]],"date-time":"2005-08-20T11:18:35Z","timestamp":1124536715000},"page":"247-257","source":"Crossref","is-referenced-by-count":13,"title":["Non-deterministic communication complexity with few witnesses"],"prefix":"10.1016","volume":"49","author":[{"given":"Mauricio","family":"Karchmer","sequence":"first","affiliation":[]},{"given":"Ilan","family":"Newman","sequence":"additional","affiliation":[]},{"given":"Mike","family":"Saks","sequence":"additional","affiliation":[]},{"given":"Avi","family":"Wigderson","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0022-0000(05)80049-2_bib1","series-title":"Proceedings, First Symp. on Structures in Complexity theory","first-page":"1","article-title":"The complexity of sparse sets in P","volume":"Vol. 223","author":"Allender","year":"1986"},{"issue":"No. 1","key":"10.1016\/S0022-0000(05)80049-2_bib2","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/0095-8956(91)90059-S","article-title":"Multicolored forests in bipartite decompositions of graphs","volume":"53","author":"Alon","year":"1991","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/S0022-0000(05)80049-2_bib3","series-title":"Proceedings, 15 th STOC","first-page":"133","article-title":"On notions of information transfer in VLSI circuits","author":"Aho","year":"1983"},{"key":"10.1016\/S0022-0000(05)80049-2_bib4","series-title":"Proceedings, 27th FOCS","first-page":"337","article-title":"Complexity classes in communication complexity theory","author":"Babai","year":"1986"},{"key":"10.1016\/S0022-0000(05)80049-2_bib5","series-title":"Proceedings, 7th STACS","first-page":"49","article-title":"Counting classes: Thresholds, parity, mods, and fewness","volume":"Vol. 415","author":"Beigel","year":"1990"},{"key":"10.1016\/S0022-0000(05)80049-2_bib6","series-title":"Proceedings, 6th STACS","first-page":"229","article-title":"On the power of parity","volume":"Vol. 349","author":"Cai","year":"1989"},{"key":"10.1016\/S0022-0000(05)80049-2_bib7","doi-asserted-by":"crossref","first-page":"2495","DOI":"10.1002\/j.1538-7305.1971.tb02618.x","article-title":"On the addressing problem for loop switching","volume":"50","author":"Graham","year":"1971","journal-title":"Bell Syst. Tech. J."},{"key":"10.1016\/S0022-0000(05)80049-2_bib8","first-page":"99","article-title":"On Embedding Graphs is Squashed Cubes","volume":"Vol. 303","author":"Graham","year":"1973"},{"key":"10.1016\/S0022-0000(05)80049-2_bib9","doi-asserted-by":"crossref","first-page":"402","DOI":"10.1016\/0022-0000(90)90027-I","article-title":"Relation between communication complexity classes","volume":"41","author":"Halsternberg","year":"1990","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0022-0000(05)80049-2_bib10","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1016\/0012-365X(84)90174-2","article-title":"A new proof of a theorem of Graham and Pollak","volume":"49","author":"Kleitman","year":"1984","journal-title":"Discr. Math."},{"key":"10.1016\/S0022-0000(05)80049-2_bib11","series-title":"Proceedings, Distributed Computing, 14th STOC","first-page":"330","article-title":"Las Vegas is better than determinism in VLSI and","author":"Melhorn","year":"1982"},{"key":"10.1016\/S0022-0000(05)80049-2_bib12","series-title":"Paths, Flows, and VLSI Layout","first-page":"235","article-title":"Communication complexity\u2014A Survey","author":"Lov\u00e1sz","year":"1990"},{"key":"10.1016\/S0022-0000(05)80049-2_bib13","doi-asserted-by":"crossref","first-page":"322","DOI":"10.1016\/0022-0000(93)90035-U","article-title":"Communication complexity and combinatorial lattice theory","volume":"47","author":"Lov\u00e1sz","year":"1993","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0022-0000(05)80049-2_bib14","series-title":"LMS Durham Symp. on Boolean Function Complexity, July 1990","first-page":"25","article-title":"On read-once Boolean functions","author":"Newman","year":"1990"},{"issue":"No. 2","key":"10.1016\/S0022-0000(05)80049-2_bib15","doi-asserted-by":"crossref","first-page":"330","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\/S0022-0000(05)80049-2_bib16","unstructured":"A. A. Razborov, The gap between the chromatic number of a graph and the rank of its adjacency matrix is superlinear, manuscript."},{"key":"10.1016\/S0022-0000(05)80049-2_bib17","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1016\/0020-0190(76)90097-1","article-title":"Relative complexity of checking and evaluating","volume":"5","author":"Valiant","year":"1976","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0022-0000(05)80049-2_bib18","first-page":"162","article-title":"Graph theoretic arguments in low-level complexity","volume":"Vol. 53","author":"Valiant","year":"1977"},{"issue":"No. 1","key":"10.1016\/S0022-0000(05)80049-2_bib19","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/0304-3975(86)90135-0","article-title":"NP is as easy as detecting unique solutions","volume":"47","author":"Valiant","year":"1986","journal-title":"J. Theoret. Comput. Sci."},{"issue":"No. 3","key":"10.1016\/S0022-0000(05)80049-2_bib20","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1016\/0022-0000(91)90024-Y","article-title":"Expressing combinatorial optimization problems by linear programs","volume":"43","author":"Yannakakis","year":"1991","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0022-0000(05)80049-2_bib21","series-title":"Proceedings, 11th STOC","first-page":"209","article-title":"Some complexity questions related to distributive computing","author":"Yao","year":"1979"}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000005800492?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000005800492?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,22]],"date-time":"2019-01-22T22:27:17Z","timestamp":1548196037000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0022000005800492"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,10]]},"references-count":21,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1994,10]]}},"alternative-id":["S0022000005800492"],"URL":"https:\/\/doi.org\/10.1016\/s0022-0000(05)80049-2","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1994,10]]}}}