Multivariate polynomial integration and differentiation are polynomial time inapproximable unless P=NP

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 7285 LNCS, Issue , 2012, Pages 182-191

  Fu, Bin ^a  

^a UNIVERSITY OF TEXAS PAN AMERICAN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION MODEL; CONSTANT COEFFICIENTS; FUNCTORS; HIGH-DIMENSIONAL; HYPERCUBE; MULTIVARIATE POLYNOMIAL; POLYNOMIAL TIME APPROXIMATION; POLYNOMIAL-TIME; PRODUCT OF SUMS; REAL NUMBER; SINGLE VARIABLE;

ALGORITHMS; INTEGRATION; MULTIVARIABLE SYSTEMS;

POLYNOMIAL APPROXIMATION;

EID: 84861210419     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-29700-7_17     Document Type: Conference Paper

References (12)

1. 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. 6508, pp. 309-323. Springer, Heidelberg (2010)
2. 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. 6831, pp. 1-15. Springer, Heidelberg (2011)
3. 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. 6831, pp. 16-30. Springer, Heidelberg (2011)
4. Cook, S.A.: The complexity of theorem-proving procedures. In: Proceedings of the 2nd Annual ACM Symposium on Theory of Computing, pp. 151-158 (1971)
5. 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 51(4), 671-697 (2004)
6. Niederreiter, H.: Quasi-monte carlo methods and pseudo-random numbers. Bulletin of the American Mathematical Society 84(6), 957-1041 (1978)
7. Niederreiter, H.: Random Number Generation and quasi-Monte Carlo Methods, vol. 63. SIAM, Philadelphia (1992)
8. Shpilka, A., Volkovich, I.: Read-once polynomial identity testing. In: Proceedings of the 40th Annual ACM Symposium on Theory of Computing, pp. 507-516 (2008)
9. Sloan, I.H., Wozniakowski, H.: An intractability result for multiple integration. Math. Comput. 66(219), 1119-1124 (1997)
10. Tovey, C.A.: A simplified satisfiability problem. Discrete Applied Mathematics 8, 85-89 (1984)
11. Trench, W.F.: Advanced Calculus. Harper & Row, New York (1978)
12. Valiant, L.: Completeness classes in algebra. In: Proceedings of the Eleventh Annual ACM Symposium on Theory of Computing, pp. 249-261 (1979)