Multivariate Polynomial Integration and Differentiation Are Polynomial Time Inapproximable Unless P=NP

DOI10.1007/978-3-642-29700-7_17zbMath1304.68061MaRDI QIDQ2897993

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

65D25: Numerical differentiation

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

65D30: Numerical integration