{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T02:51:18Z","timestamp":1725677478159},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642296994"},{"type":"electronic","value":"9783642297007"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-29700-7_17","type":"book-chapter","created":{"date-parts":[[2012,4,28]],"date-time":"2012-04-28T08:25:56Z","timestamp":1335601556000},"page":"182-191","source":"Crossref","is-referenced-by-count":1,"title":["Multivariate Polynomial Integration and Differentiation Are Polynomial Time Inapproximable Unless P=NP"],"prefix":"10.1007","author":[{"given":"Bin","family":"Fu","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"17_CR1","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":"17_CR2","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":"17_CR3","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":"17_CR4","doi-asserted-by":"crossref","unstructured":"Cook, S.A.: The complexity of theorem-proving procedures. In: Proceedings of the 2nd Annual ACM Symposium on Theory of Computing, pp. 151\u2013158 (1971)","DOI":"10.1145\/800157.805047"},{"issue":"4","key":"17_CR5","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1145\/1008731.1008738","volume":"51","author":"M. Jerrum","year":"2004","unstructured":"Jerrum, M., Sinclaire, A., Vigoda, E.: A polynomial-time ap- priximation algorithm for the permanent of a matrix with nonnegative entries. Journal of the ACM\u00a051(4), 671\u2013697 (2004)","journal-title":"Journal of the ACM"},{"issue":"6","key":"17_CR6","doi-asserted-by":"publisher","first-page":"957","DOI":"10.1090\/S0002-9904-1978-14532-7","volume":"84","author":"H. Niederreiter","year":"1978","unstructured":"Niederreiter, H.: Quasi-monte carlo methods and pseudo-random numbers. Bulletin of the American Mathematical Society\u00a084(6), 957\u20131041 (1978)","journal-title":"Bulletin of the American Mathematical Society"},{"key":"17_CR7","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611970081","volume-title":"Random Number Generation and quasi-Monte Carlo Methods","author":"H. Niederreiter","year":"1992","unstructured":"Niederreiter, H.: Random Number Generation and quasi-Monte Carlo Methods, vol.\u00a063. SIAM, Philadelphia (1992)"},{"key":"17_CR8","doi-asserted-by":"crossref","unstructured":"Shpilka, A., Volkovich, I.: Read-once polynomial identity testing. In: Proceedings of the 40th Annual ACM Symposium on Theory of Computing, pp. 507\u2013516 (2008)","DOI":"10.1145\/1374376.1374448"},{"issue":"219","key":"17_CR9","doi-asserted-by":"publisher","first-page":"1119","DOI":"10.1090\/S0025-5718-97-00834-X","volume":"66","author":"I.H. Sloan","year":"1997","unstructured":"Sloan, I.H., Wozniakowski, H.: An intractability result for multiple integration. Math. Comput.\u00a066(219), 1119\u20131124 (1997)","journal-title":"Math. Comput."},{"key":"17_CR10","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/0166-218X(84)90081-7","volume":"8","author":"C.A. Tovey","year":"1984","unstructured":"Tovey, C.A.: A simplified satisfiability problem. Discrete Applied Mathematics\u00a08, 85\u201389 (1984)","journal-title":"Discrete Applied Mathematics"},{"key":"17_CR11","volume-title":"Advanced Calculus","author":"W.F. Trench","year":"1978","unstructured":"Trench, W.F.: Advanced Calculus. Harper & Row, New York (1978)"},{"key":"17_CR12","doi-asserted-by":"crossref","unstructured":"Valiant, L.: Completeness classes in algebra. In: Proceedings of the Eleventh Annual ACM Symposium on Theory of Computing, pp. 249\u2013261 (1979)","DOI":"10.1145\/800135.804419"}],"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-29700-7_17.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T07:14:01Z","timestamp":1620112441000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-29700-7_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642296994","9783642297007"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-29700-7_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}