Multivariate Polynomial Integration and Derivative Are Polynomial Time Inapproximable unless P=NP
Bin Fu

TL;DR
This paper proves that approximating multivariate polynomial integration and derivatives within any factor polynomial time is NP-hard, highlighting their computational intractability unless P=NP, and discusses some special cases where these problems are tractable.
Contribution
It establishes NP-hardness of approximating multivariate polynomial integration and derivatives, and compares their computational complexity in high dimensions.
Findings
No polynomial-time approximation for multivariate polynomial integration unless P=NP.
No polynomial-time approximation for multivariate derivatives unless P=NP.
Derivative complexity is comparable to integration in high dimensions.
Abstract
We investigate the complexity of integration and derivative for multivariate polynomials in the standard computation model. The integration is in the unit cube for a multivariate polynomial, which has format , where each with all single variable polynomials of degree at most two and constant coefficients. We show that there is no any factor polynomial time approximation for the integration unless . For the complexity of multivariate derivative, we consider the functions with the format where each is of degree at most and coefficients. We also show that…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsPolynomial and algebraic computation · Numerical Methods and Algorithms · Advanced Numerical Analysis Techniques
