{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,7]],"date-time":"2025-03-07T23:40:02Z","timestamp":1741390802127,"version":"3.38.0"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642226151"},{"type":"electronic","value":"9783642226168"}],"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-22616-8_2","type":"book-chapter","created":{"date-parts":[[2011,7,30]],"date-time":"2011-07-30T01:25:42Z","timestamp":1311989142000},"page":"16-30","source":"Crossref","is-referenced-by-count":4,"title":["Algorithms for Testing Monomials in Multivariate Polynomials"],"prefix":"10.1007","author":[{"given":"Zhixiang","family":"Chen","sequence":"first","affiliation":[]},{"given":"Bin","family":"Fu","sequence":"additional","affiliation":[]},{"given":"Yang","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Robert","family":"Schweller","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"4","key":"2_CR1","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1145\/792538.792540","volume":"50","author":"M. Agrawal","year":"2003","unstructured":"Agrawal, M., Biswas, S.: Primality and identity testing via Chinese remaindering. Journal of the ACM\u00a050(4), 429\u2013443 (2003)","journal-title":"Journal of the ACM"},{"issue":"2","key":"2_CR2","doi-asserted-by":"publisher","first-page":"781","DOI":"10.4007\/annals.2004.160.781","volume":"160","author":"M. Agrawal","year":"2004","unstructured":"Agrawal, M., Kayal, N., Saxena, N.: PRIMES is in P. Ann. of Math.\u00a0160(2), 781\u2013793 (2004)","journal-title":"Ann. of Math."},{"issue":"3","key":"2_CR3","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1145\/278298.278306","volume":"45","author":"S. Arora","year":"1998","unstructured":"Arora, S., Lund, C., Motwani, R., Sudan, M., Szegedy, M.: Proof verification and the hardness of approximation problems. Journal of the ACM\u00a045(3), 501\u2013555 (1998)","journal-title":"Journal of the ACM"},{"issue":"3","key":"2_CR4","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/0020-0190(79)90002-4","volume":"8","author":"B. Aspvall","year":"1979","unstructured":"Aspvall, B., Plass, M.F., Tarjan, R.E.: A linear-time algorithm for testing the truth of certain quantified boolean formulas. Information Processing Letters\u00a08(3), 121\u2013123 (1979)","journal-title":"Information Processing Letters"},{"key":"2_CR5","doi-asserted-by":"crossref","unstructured":"Beigel, R.: The polynomial method in circuit compplexity. In: Proceedings of the Eighth Conference on Structure in Complexity Theory, pp. 82\u201395 (1993)","DOI":"10.1109\/SCT.1993.336538"},{"key":"2_CR6","doi-asserted-by":"crossref","unstructured":"Chen, Z., Fu, B.: The complexity of testting monomials in multivariate polynomials. In: Proceedings of the Fifth International Conference on Combinatorial Optimization and Applications (2011)","DOI":"10.1007\/978-3-642-22616-8_1"},{"key":"2_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1007\/978-3-642-17458-2_26","volume-title":"Combinatorial Optimization and Applications","author":"Z. Chen","year":"2010","unstructured":"Chen, Z., Fu, B.: Approximating multilinear monomial coefficients and maximum multilinear monomials in multivariate polynomials. In: Wu, W., Daescu, O. (eds.) COCOA 2010, Part I. LNCS, vol.\u00a06508, pp. 309\u2013323. Springer, Heidelberg (2010) (The full version will appear in Journal of Combinatorial Optimization)"},{"key":"2_CR8","unstructured":"Chen, J., Lu, S., Sze, S.-H., Zhang, F.: Improved algorithms for path, matching, and packing problems. In: SODA, pp. 298\u2013307 (2007)"},{"issue":"1-2","key":"2_CR9","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/0304-3975(94)00097-3","volume":"141","author":"R.G. Downey","year":"1995","unstructured":"Downey, R.G., Fellows, M.R.: Fixed parameter tractability and completeness. II. On completeness for W(1). Theoretical Computer Science\u00a0141(1-2), 109\u2013131 (1995)","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"2_CR10","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1145\/226643.226652","volume":"43","author":"U. Feige","year":"1996","unstructured":"Feige, U., Goldwasser, S., Lov\u00e1sz, L., Safra, S., Szegedy, M.: Interactive proofs and the hardness of approximating cliques. Journal of the ACM\u00a043(2), 268\u2013292 (1996)","journal-title":"Journal of the ACM"},{"issue":"3","key":"2_CR11","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/BF02582920","volume":"8","author":"B. Fu","year":"1992","unstructured":"Fu, B.: Separating PH from PP by relativization. Acta Math. Sinica\u00a08(3), 329\u2013336 (1992)","journal-title":"Acta Math. Sinica"},{"key":"2_CR12","doi-asserted-by":"crossref","unstructured":"Kabanets, V., Impagliazzo, R.: Derandomizing polynomial identity tests means proving circuit lower bounds. In: STOC, pp. 355\u2013364 (2003)","DOI":"10.1145\/780542.780595"},{"key":"2_CR13","doi-asserted-by":"crossref","unstructured":"Klivans, A., Servedio, R.A.: Learning DNF in time $2^{\\tilde{O}(n^{1\/3})}$ . In: STOC, pp. 258\u2013265 (2001)","DOI":"10.1145\/380752.380809"},{"key":"2_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1007\/978-3-540-70575-8_47","volume-title":"Proceedings of the International Colloquium on Automata, Language and Programming (ICALP)","author":"I. Koutis","year":"2008","unstructured":"Koutis, I.: Faster algebraic algorithms for path and packing problems. In: Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part I. LNCS, vol.\u00a05125, pp. 575\u2013586. Springer, Heidelberg (2008)"},{"key":"2_CR15","volume-title":"Perceptrons (expanded edition 1988)","author":"M. Minsky","year":"1968","unstructured":"Minsky, M., Papert, S.: Perceptrons (expanded edition 1988). MIT Press, Cambridge (1968)"},{"key":"2_CR16","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511814075","volume-title":"Randomized Algorithms","author":"R. Motwani","year":"1995","unstructured":"Motwani, R., Raghavan, P.: Randomized Algorithms. Cambridge University Press, Cambridge (1995)"},{"key":"2_CR17","doi-asserted-by":"crossref","unstructured":"Naor, M., Schulman, L.J., Srinivasan, A.: Splitters and near-optimal derandomization. In: FOCS, pp. 182\u2013191 (1995)","DOI":"10.1109\/SFCS.1995.492475"},{"issue":"1","key":"2_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00037-005-0188-8","volume":"14","author":"R. Raz","year":"2005","unstructured":"Raz, R., Shpilka, A.: Deterministic polynomial identity testing in non-commutative models. Computational Complexity\u00a014(1), 1\u201319 (2005)","journal-title":"Computational Complexity"},{"issue":"4","key":"2_CR19","doi-asserted-by":"publisher","first-page":"869","DOI":"10.1145\/146585.146609","volume":"39","author":"A. Shamir","year":"1992","unstructured":"Shamir, A.: IP = PSPACE. Journal of the ACM\u00a039(4), 869\u2013877 (1992)","journal-title":"Journal of the ACM"},{"key":"2_CR20","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1016\/j.ipl.2008.11.004","volume":"109","author":"R. Williams","year":"2009","unstructured":"Williams, R.: Finding paths of length k in O *(2 k ) time. Information Processing Letters\u00a0109, 315\u2013318 (2009)","journal-title":"Information Processing Letters"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-22616-8_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,7]],"date-time":"2025-03-07T23:03:48Z","timestamp":1741388628000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-22616-8_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642226151","9783642226168"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-22616-8_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}