{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:54:50Z","timestamp":1725490490072},"publisher-location":"Berlin, Heidelberg","reference-count":5,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540742395"},{"type":"electronic","value":"9783540742401"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-74240-1_28","type":"book-chapter","created":{"date-parts":[[2007,8,27]],"date-time":"2007-08-27T07:04:18Z","timestamp":1188198258000},"page":"322-327","source":"Crossref","is-referenced-by-count":0,"title":["Representing the Boolean OR Function by Quadratic Polynomials Modulo 6"],"prefix":"10.1007","author":[{"given":"Gyula","family":"Gy\u0151r","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"28_CR1","first-page":"455","volume-title":"STOC","author":"D.A. Mix Barrington","year":"1992","unstructured":"Mix Barrington, D.A., Beigel, R., Rudich, S.: Representing boolean functions as polynomials modulo composite numbers (extended abstract). In: STOC, pp. 455\u2013461. ACM Press, New York (1992)"},{"key":"28_CR2","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1090\/S0002-9904-1947-08785-1","volume":"53","author":"P. Erd\u0151s.","year":"1947","unstructured":"Erd\u0151s, P.: Some remarks on the theory of graphs. Bull. Am. Math. Soc.\u00a053, 292\u2013294 (1947)","journal-title":"Bull. Am. Math. Soc."},{"issue":"1","key":"28_CR3","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/s004930070032","volume":"20","author":"V. Grolmusz","year":"2000","unstructured":"Grolmusz, V.: Superpolynomial size set-systems with restricted intersections mod 6 and explicit ramsey graphs. Combinatorica\u00a020(1), 71\u201386 (2000)","journal-title":"Combinatorica"},{"key":"28_CR4","first-page":"77","volume-title":"STOC","author":"R. Smolensky","year":"1987","unstructured":"Smolensky, R.: Algebraic methods in the theory of lower bounds for boolean circuit complexity. In: STOC, pp. 77\u201382. ACM, New York (1987)"},{"key":"28_CR5","doi-asserted-by":"crossref","unstructured":"Tardos, G., Mix Barrington, D.A.: A lower bound on the mod 6 degree of the or function. In: ISTCS, pp. 52\u201356 (1995)","DOI":"10.1109\/ISTCS.1995.377046"}],"container-title":["Lecture Notes in Computer Science","Fundamentals of Computation Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74240-1_28.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:15:14Z","timestamp":1619504114000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74240-1_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540742395","9783540742401"],"references-count":5,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74240-1_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}