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

DOI10.1007/978-3-642-29700-7_17zbMATH Open1304.68061OpenAlexW2105864510MaRDI QIDQ2897993FDOQ2897993

Authors Bin Fu

Publication date 16 July 2012

Published in Frontiers in Algorithmics and Algorithmic Aspects in Information and Management (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-29700-7_17

Mathematics Subject Classification ID

Numerical integration (65D30) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Numerical differentiation (65D25)

Recommendations

• scientific article; zbMATH DE number 4110107
• How to integrate a polynomial over a simplex
• The computational complexity of maximization and integration

Cited in

(3)

• scientific article; zbMATH DE number 4110107 (Why is no real title available?)
• Integration and optimization of multivariate polynomials by restriction onto a random subspace
• How to integrate a polynomial over a simplex

This page was built for publication: Multivariate polynomial integration and differentiation are polynomial time inapproximable unless \(\text{P}=\text{NP}\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2897993)