Approximation and complexity. II: Iterated integration

DOI10.1007/S102080010023MaRDI QIDQ1865831zbMATH OpenOpenAlexFDO

Authors Dima Grigoriev

Publication date 2 April 2003

Published in Foundations of Computational Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s102080010023

zbMATH Keywords

Pfaffian functions

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Recommendations

• scientific article; zbMATH DE number 1223775
• Some results on the complexity of numerical integration
• Computational Science – ICCS 2005
• On subrecursive complexity of integration
• Numerical integration and approximation of differentiable functions. II
• scientific article; zbMATH DE number 4056873
• scientific article; zbMATH DE number 3135971
• Publication:3202345
• scientific article; zbMATH DE number 2123414
• Integration and approximation in arbitrary dimensions

Cited in

(2)

• Instability, complexity, and evolution
• Algorithms and complexity in biological pattern formation problems

This page was built for publication: Approximation and complexity. II: Iterated integration

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