{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T10:04:37Z","timestamp":1743156277188,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642207112"},{"type":"electronic","value":"9783642207129"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-20712-9_3","type":"book-chapter","created":{"date-parts":[[2011,6,11]],"date-time":"2011-06-11T00:05:22Z","timestamp":1307750722000},"page":"29-42","source":"Crossref","is-referenced-by-count":1,"title":["Learning Read-Constant Polynomials of Constant Degree Modulo Composites"],"prefix":"10.1007","author":[{"given":"Arkadev","family":"Chattopadhyay","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ricard","family":"Gavald\u00e0","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kristoffer Arnsfelt","family":"Hansen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Denis","family":"Th\u00e9rien","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"6","key":"3_CR1","doi-asserted-by":"publisher","first-page":"1515","DOI":"10.1137\/S0097539794274398","volume":"27","author":"H. Aizenstein","year":"1998","unstructured":"Aizenstein, H., Blum, A., Khardon, R., Kushilevitz, E., Pitt, L., Roth, D.: On learning read-k-satisfy-j dnf. SIAM J. Comput.\u00a027(6), 1515\u20131530 (1998)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"3_CR2","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1145\/138027.138061","volume":"40","author":"D. Angluin","year":"1993","unstructured":"Angluin, D., Hellerstein, L., Karpinski, M.: Learning read-once formulas with queries. J. ACM\u00a040(1), 185\u2013210 (1993)","journal-title":"J. ACM"},{"issue":"1","key":"3_CR3","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1016\/0022-0000(89)90037-8","volume":"38","author":"D.A.M. Barrington","year":"1989","unstructured":"Barrington, D.A.M.: Bounded-width polynomial-size branching programs recognize exactly those languages in \n                  \n                    \n                  \n                  $\\text{NC}^1$\n                . J. Comput. Syst. Sci.\u00a038(1), 150\u2013164 (1989)","journal-title":"J. Comput. Syst. Sci."},{"key":"3_CR4","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/BF01263424","volume":"4","author":"D.A.M. Barrington","year":"1994","unstructured":"Barrington, D.A.M., Beigel, R., Rudich, S.: Representing boolean functions as polynomials modulo composite numbers. Comput. Complexity\u00a04, 367\u2013382 (1994)","journal-title":"Comput. Complexity"},{"issue":"3","key":"3_CR5","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1006\/jcss.1995.1029","volume":"50","author":"D.A.M. Barrington","year":"1995","unstructured":"Barrington, D.A.M., Straubing, H.: Superlinear lower bounds for bounded-width branching programs. J. Comput. Syst. Sci.\u00a050(3), 374\u2013381 (1995)","journal-title":"J. Comput. Syst. Sci."},{"issue":"2","key":"3_CR6","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/0890-5401(90)90007-5","volume":"89","author":"D.A.M. Barrington","year":"1990","unstructured":"Barrington, D.A.M., Straubing, H., Th\u00e9rien, D.: Non-uniform automata over groups. Inform. and Comput.\u00a089(2), 109\u2013132 (1990)","journal-title":"Inform. and Comput."},{"issue":"4","key":"3_CR7","doi-asserted-by":"publisher","first-page":"941","DOI":"10.1145\/48014.63138","volume":"35","author":"D.A.M. Barrington","year":"1988","unstructured":"Barrington, D.A.M., Th\u00e9rien, D.: Finite monoids and the finite structure of \n                  \n                    \n                  \n                  $\\text{NC}^1$\n                . J. ACM\u00a035(4), 941\u2013952 (1988)","journal-title":"J. ACM"},{"key":"3_CR8","doi-asserted-by":"publisher","first-page":"506","DOI":"10.1145\/337244.337257","volume":"47","author":"A. Beimel","year":"2000","unstructured":"Beimel, A., Bergadano, F., Bshouty, N., Kushilevitz, E., Varricchio, S.: Learning functions represented as multiplicity automata. J. ACM\u00a047, 506\u2013530 (2000)","journal-title":"J. ACM"},{"issue":"9","key":"3_CR9","doi-asserted-by":"publisher","first-page":"627","DOI":"10.1016\/j.crma.2005.03.008","volume":"340","author":"J. Bourgain","year":"2005","unstructured":"Bourgain, J.: Estimation of certain exponential sums arising in complexity theory. C. R. Acad. Sci. Paris\u00a0340(9), 627\u2013631 (2005)","journal-title":"C. R. Acad. Sci. Paris"},{"key":"3_CR10","first-page":"40","volume-title":"51th Annual IEEE Symposium on Foundations of Computer Science","author":"M. Braverman","year":"2010","unstructured":"Braverman, M., Rao, A., Raz, R., Yehudayoff, A.: Pseudorandom generators for regular branching programs. In: 51th Annual IEEE Symposium on Foundations of Computer Science, pp. 40\u201347. IEEE Computer Society Press, Los Alamitos (2010)"},{"key":"3_CR11","first-page":"30","volume-title":"51th Annual IEEE Symposium on Foundations of Computer Science","author":"J. Brody","year":"2010","unstructured":"Brody, J., Verbin, E.: The coin problem, and pseudorandomness for branching programs. In: 51th Annual IEEE Symposium on Foundations of Computer Science, pp. 30\u201339. IEEE Computer Society Press, Los Alamitos (2010)"},{"key":"3_CR12","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/PL00013836","volume":"22","author":"N. Bshouty","year":"1998","unstructured":"Bshouty, N., Tamon, C., Wilson, D.: Learning matrix functions over rings. Algorithmica\u00a022, 91\u2013111 (1998)","journal-title":"Algorithmica"},{"key":"3_CR13","unstructured":"Chattopadhyay, A.: Multilinear polynomials modulo composites. Bulletin of the European Association on Theoretical Computer Science, Computational Complexity Column, 100 (February 2010)"},{"key":"3_CR14","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1145\/1536414.1536422","volume-title":"41st Annual Symposium on Theory of Computing","author":"K. Efremenko","year":"2009","unstructured":"Efremenko, K.: 3-query locally decodable codes of subexponential length. In: 41st Annual Symposium on Theory of Computing, pp. 39\u201344. ACM Press, New York (2009)"},{"key":"3_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/978-3-642-04414-4_19","volume-title":"Algorithmic Learning Theory","author":"R. Gavald\u00e0","year":"2009","unstructured":"Gavald\u00e0, R., Th\u00e9rien, D.: An algebraic perspective on boolean function learning. In: Gavald\u00e0, R., Lugosi, G., Zeugmann, T., Zilles, S. (eds.) ALT 2009. LNCS, vol.\u00a05809, pp. 201\u2013215. Springer, Heidelberg (2009)"},{"key":"3_CR16","first-page":"115","volume-title":"21st Annual IEEE Conference on Computational Complexity","author":"P. Gopalan","year":"2006","unstructured":"Gopalan, P.: Constructing ramsey graphs from boolean function representations. In: 21st Annual IEEE Conference on Computational Complexity, pp. 115\u2013128. IEEE Computer Society Press, Los Alamitos (2006)"},{"key":"3_CR17","doi-asserted-by":"crossref","unstructured":"Grolmusz, V.: On the weak mod m representation of boolean functions. Chicago J. Theoret. Comput. Sci. (1995)","DOI":"10.4086\/cjtcs.1995.002"},{"key":"3_CR18","first-page":"165","volume":"5","author":"D.P. Helmbold","year":"1990","unstructured":"Helmbold, D.P., Sloan, R.H., Warmuth, M.K.: Learning nested differences of intersection-closed concept classes. Machine Learning\u00a05, 165\u2013196 (1990)","journal-title":"Machine Learning"},{"key":"3_CR19","volume-title":"43rd Annual ACM Symposium on Theory of Computing","author":"M. Kouck\u00fd","year":"2011","unstructured":"Kouck\u00fd, M., Nimbhorkar, P., Pudl\u00e1k, P.: Pseudorandom generators for group products. In: 43rd Annual ACM Symposium on Theory of Computing. ACM Press, New York (2011, to appear)"},{"issue":"2","key":"3_CR20","first-page":"93","volume":"306","author":"P. P\u00e9ladeau","year":"1988","unstructured":"P\u00e9ladeau, P., Th\u00e9rien, D.: Sur les langages reconnus par des groupes nilpotents. C. R. Math. Acad. Sci. Paris S\u00e9r I Math.\u00a0306(2), 93\u201395 (1988)","journal-title":"C. R. Math. Acad. Sci. Paris S\u00e9r I Math."},{"key":"3_CR21","unstructured":"P\u00e9ladeau, P., Th\u00e9rien, D.: On the languages recognized by nilpotent groups (a translation of \u201dsur les languages reconnus par des groupes nilpotents\u201d). In: Electronic Colloquium on Computational Complexity (ECCC), vol. 8(40) (2001)"},{"issue":"3","key":"3_CR22","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/BF01137685","volume":"41","author":"A.A. Razborov","year":"1987","unstructured":"Razborov, A.A.: Lower bounds on the size of bounded-depth networks over a complete basis with logical addition. Math. Notes of the Acad. of Sci. of USSR\u00a041(3), 333\u2013338 (1987)","journal-title":"Math. Notes of the Acad. of Sci. of USSR"},{"issue":"2","key":"3_CR23","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1006\/jcss.1996.0017","volume":"52","author":"R.E. Schapire","year":"1996","unstructured":"Schapire, R.E., Sellie, L.: Learning sparse multivariate polynomials over a field with queries and counterexamples. J. Comput. Syst. Sci.\u00a052(2), 201\u2013213 (1996)","journal-title":"J. Comput. Syst. Sci."},{"key":"3_CR24","first-page":"77","volume-title":"19th Annual ACM Symposium on Theory of Computing","author":"R. Smolensky","year":"1987","unstructured":"Smolensky, R.: Algebraic methods in the theory of lower bounds for boolean circuit complexity. In: 19th Annual ACM Symposium on Theory of Computing, pp. 77\u201382. ACM Press, New York (1987)"},{"issue":"2","key":"3_CR25","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/PL00001597","volume":"7","author":"G. Tardos","year":"1998","unstructured":"Tardos, G., Barrington, D.A.M.: A lower bound on the \n                  \n                    \n                  \n                  $\\text{MOD}$\n                -6 degree of the \n                  \n                    \n                  \n                  $\\text{OR}$\n                 function. Comput. Complexity\u00a07(2), 99\u2013108 (1998)","journal-title":"Comput. Complexity"}],"container-title":["Lecture Notes in Computer Science","Computer Science \u2013 Theory and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-20712-9_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,28]],"date-time":"2019-03-28T12:43:01Z","timestamp":1553776981000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-20712-9_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642207112","9783642207129"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-20712-9_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}