{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T00:24:43Z","timestamp":1729643083612,"version":"3.28.0"},"reference-count":19,"publisher":"IEEE Comput. Soc. Press","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/sct.1992.215402","type":"proceedings-article","created":{"date-parts":[[2003,1,2]],"date-time":"2003-01-02T14:33:59Z","timestamp":1041518039000},"page":"275-281","source":"Crossref","is-referenced-by-count":1,"title":["Non-deterministic communication complexity with few witnesses"],"prefix":"10.1109","author":[{"given":"M.","family":"Karchmer","sequence":"first","affiliation":[]},{"given":"M.","family":"Saks","sequence":"additional","affiliation":[]},{"given":"I.","family":"Newman","sequence":"additional","affiliation":[]},{"given":"A.","family":"Wigderson","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","first-page":"330","article-title":"Las Vegas is Better than Determinism in VLSI and Distributed Computing","author":"mehlhorn","year":"1982","journal-title":"Proc of the 14th STOC"},{"key":"ref11","first-page":"235","author":"lov\ufffdsz","year":"1990","journal-title":"Paths Flows and VLSI Layout"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1988.21924"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511526633.004"},{"key":"ref14","first-page":"330","article-title":"Communication Complexity","author":"papadimitriou","year":"1982","journal-title":"Proc 14th ACM STOC"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(92)90691-8"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(76)90097-1"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/22145.22196"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/62212.62232"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/800135.804414"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1986.15"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/800061.808742"},{"key":"ref6","first-page":"229","article-title":"On the power of parity","volume":"349","author":"cai","year":"1989","journal-title":"Proc of the 6th STACS"},{"key":"ref5","first-page":"49","article-title":"Counting classes: thresholds, parity, mods, and fewness","volume":"415","author":"beigel","year":"1990","journal-title":"Proc 7th STACS"},{"key":"ref8","first-page":"99","volume":"303","author":"graham","year":"1973","journal-title":"On embedding graphs in squashed cubes"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1971.tb02618.x"},{"year":"0","key":"ref2"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-16486-3_85"},{"key":"ref9","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":"Discrete Mathematics"}],"event":{"name":"[1992] Seventh Annual Structure in Complexity Theory Conference","location":"Boston, MA, USA"},"container-title":["[1992] Proceedings of the Seventh Annual Structure in Complexity Theory Conference"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx2\/430\/5629\/00215402.pdf?arnumber=215402","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,15]],"date-time":"2017-06-15T17:10:01Z","timestamp":1497546601000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/215402\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":19,"URL":"https:\/\/doi.org\/10.1109\/sct.1992.215402","relation":{},"subject":[]}}