{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:26:55Z","timestamp":1750307215727,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":22,"publisher":"ACM","license":[{"start":{"date-parts":[[2012,1,8]],"date-time":"2012-01-08T00:00:00Z","timestamp":1325980800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"BSF","award":["2008411"],"award-info":[{"award-number":["2008411"]}]},{"DOI":"10.13039\/501100000781","name":"European Research Council","doi-asserted-by":"publisher","award":["259426"],"award-info":[{"award-number":["259426"]}],"id":[{"id":"10.13039\/501100000781","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003977","name":"Israel Science Foundation","doi-asserted-by":"publisher","award":["1361\/10"],"award-info":[{"award-number":["1361\/10"]}],"id":[{"id":"10.13039\/501100003977","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2012,1,8]]},"DOI":"10.1145\/2090236.2090244","type":"proceedings-article","created":{"date-parts":[[2012,1,10]],"date-time":"2012-01-10T17:02:17Z","timestamp":1326214937000},"page":"76-89","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["From randomizing polynomials to parallel algorithms"],"prefix":"10.1145","author":[{"given":"Yuval","family":"Ishai","sequence":"first","affiliation":[{"name":"Technion, Haifa, Israel"}]},{"given":"Eyal","family":"Kushilevitz","sequence":"additional","affiliation":[{"name":"Technion, Haifa, Israel"}]},{"given":"Anat","family":"Paskin-Cherniavsky","sequence":"additional","affiliation":[{"name":"Technion, Haifa, Israel"}]}],"member":"320","published-online":{"date-parts":[[2012,1,8]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"crossref","first-page":"148","DOI":"10.1515\/crll.1941.183.148","article-title":"Untersuchungen \u00fcber quadratischen Formen in K\u00f6rpern der Charakteristik 2","volume":"183","author":"Arf C.","year":"1941","journal-title":"I In J. Reine Angew. Math."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2004.20"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00037-006-0211-8"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/62212.62213"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/1382436.1382788"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/1766171.1766223"},{"key":"e_1_3_2_1_7_1","first-page":"460","volume-title":"Proc. ICS","author":"Dvir Z.","year":"2011"},{"key":"e_1_3_2_1_8_1","unstructured":"A. Ehrenfeucht and M. Karpinski. The computational complexity of (XOR AND)-counting problems. TR-90-033 1990   A. Ehrenfeucht and M. Karpinski. The computational complexity of (XOR AND)-counting problems. TR-90-033 1990"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/22145.22150"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1250790.1250855"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1374376.1374399"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/11682462_51"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1991.185433"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.5555\/795666.796556"},{"volume-title":"Proc. ICALP '02","author":"Ishai Y.","key":"e_1_3_2_1_15_1"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1993.1014"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"crossref","unstructured":"R. Lidl and H. Niederreiter. Introduction to finite fields and their applications. 1997  R. Lidl and H. Niederreiter. Introduction to finite fields and their applications. 1997","DOI":"10.1017\/CBO9780511525926"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1090\/dimacs\/002\/13"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/12130.12164"},{"key":"e_1_3_2_1_20_1","unstructured":"J. R. Norris. Markov chains (book). Cambridge university press 2008.  J. R. Norris. Markov chains (book). Cambridge university press 2008."},{"key":"e_1_3_2_1_21_1","first-page":"132","volume-title":"Proc. MFCS","author":"Valiant L. G.","year":"1981"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"crossref","unstructured":"C. Wallace. A suggestion for a fast multiplier. IEEE Trans. Elec. Comput. EC-I3 (1964) pp. 14--17.  C. Wallace. A suggestion for a fast multiplier. IEEE Trans. Elec. Comput. EC-I3 (1964) pp. 14--17.","DOI":"10.1109\/PGEC.1964.263830"}],"event":{"name":"ITCS '12: Innovations in Theoretical Computer Science","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Cambridge Massachusetts","acronym":"ITCS '12"},"container-title":["Proceedings of the 3rd Innovations in Theoretical Computer Science Conference"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2090236.2090244","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2090236.2090244","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T10:06:46Z","timestamp":1750241206000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2090236.2090244"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,1,8]]},"references-count":22,"alternative-id":["10.1145\/2090236.2090244","10.1145\/2090236"],"URL":"https:\/\/doi.org\/10.1145\/2090236.2090244","relation":{},"subject":[],"published":{"date-parts":[[2012,1,8]]},"assertion":[{"value":"2012-01-08","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}