{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,1]],"date-time":"2025-05-01T16:11:04Z","timestamp":1746115864825,"version":"3.40.4"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642387555"},{"type":"electronic","value":"9783642387562"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38756-2_13","type":"book-chapter","created":{"date-parts":[[2013,5,21]],"date-time":"2013-05-21T00:43:48Z","timestamp":1369097028000},"page":"106-117","source":"Crossref","is-referenced-by-count":0,"title":["Monomial Testing and Applications"],"prefix":"10.1007","author":[{"given":"Shenshi","family":"Chen","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"13_CR1","unstructured":"Abasi, H., Bshouty, N.: A simple algorithm for undirected hamiltonicity, ECCC, Report No. 12 (2013)"},{"key":"13_CR2","unstructured":"Chen, S., Chen, Y., Yang, Q.: Towards randomized testing of q-monomials in multivariate polynomials (January 2013) (manuscript), http:\/\/arxiv.org\/abs\/1302.5898"},{"key":"13_CR3","doi-asserted-by":"crossref","unstructured":"Bj\u00f6rklund, A.: Determinant sums for undirected hamilonicity. In: Proceedings of the 51th IEEE Foundations of Computer Science (FOCS 2010), pp. 173\u2013182 (2010)","DOI":"10.1109\/FOCS.2010.24"},{"key":"13_CR4","unstructured":"Bj\u00f6rklund, A., Husfeldt, T., Kaski, P., Koivisto, M.: Narrow sieves for parameterized paths and packings. arXiv:1007.1161v1 (2010)"},{"issue":"1","key":"13_CR5","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1145\/200836.200880","volume":"42","author":"M. Blum","year":"1995","unstructured":"Blum, M., Kannan, S.: Designing programs that check their work. J. ACM\u00a042(1), 269\u2013291 (1995)","journal-title":"J. ACM"},{"issue":"2","key":"13_CR6","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1007\/s10878-012-9496-5","volume":"25","author":"Z. Chen","year":"2013","unstructured":"Chen, Z., Fu, B.: Approximating Multilinear Monomial Coefficients and Maximum Multilinear Monomials in Multivariate Polynomials. J. Comb. Optim.\u00a025(2), 234\u2013254 (2013)","journal-title":"J. Comb. Optim."},{"key":"13_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-22616-8_1","volume-title":"Combinatorial Optimization and Applications","author":"Z. Chen","year":"2011","unstructured":"Chen, Z., Fu, B.: The Complexity of Testing Monomials in Multivariate Polynomials. In: Wang, W., Zhu, X., Du, D.-Z. (eds.) COCOA 2011. LNCS, vol.\u00a06831, pp. 1\u201315. Springer, Heidelberg (2011)"},{"key":"13_CR8","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)"},{"key":"13_CR9","doi-asserted-by":"crossref","unstructured":"Chen, Z., Fu, B., Liu, Y., Schweller, R.T.: On Testing Monomials in Multivariate Polynomials. Theoretical Computer Science (April 13, 2012) (forthcoming), doi:10.1016\/j.tcs.2012.03.038","DOI":"10.1016\/j.tcs.2012.03.038"},{"key":"13_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1007\/978-3-642-22616-8_2","volume-title":"Combinatorial Optimization and Applications","author":"Z. Chen","year":"2011","unstructured":"Chen, Z., Fu, B., Liu, Y., Schweller, R.: Algorithms for Testing Monomials in Multivariate Polynomials. In: Wang, W., Zhu, X., Du, D.-Z. (eds.) COCOA 2011. LNCS, vol.\u00a06831, pp. 16\u201330. Springer, Heidelberg (2011)"},{"key":"13_CR11","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":"2","key":"13_CR12","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/s00453-007-9146-y","volume":"52","author":"M.R. Fellows","year":"2008","unstructured":"Fellows, M.R., Knauer, C., Nishimura, N., Ragde, P., Rosamond, F., Stege, U., Thilikos, D.M., Whitesides, S.: Faster fixed-parameter tractable algorithms for matching and packing problems. Algorithmica\u00a052(2), 167\u2013176 (2008)","journal-title":"Algorithmica"},{"key":"13_CR13","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":"Automata, Languages and Programming","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":"13_CR14","doi-asserted-by":"crossref","unstructured":"Motwani, R., Raghavan, P.: Randomized Algorithms. Cambridge University Press (1995)","DOI":"10.1017\/CBO9780511814075"},{"key":"13_CR15","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":"13_CR16","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"},{"key":"13_CR17","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","Frontiers in Algorithmics and Algorithmic Aspects in Information and Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38756-2_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,30]],"date-time":"2025-04-30T10:42:49Z","timestamp":1746009769000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38756-2_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642387555","9783642387562"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38756-2_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}