Continuous problems: optimality, complexity, tractability (invited talk)

DOI10.1007/978-3-319-10515-4_26MaRDI QIDQ2879339zbMATH OpenOpenAlexFDO

Authors Leszek Plaskota

Publication date 8 September 2014

Published in Computer Algebra in Scientific Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-10515-4_26

Mathematics Subject Classification ID

Complexity and performance of numerical algorithms (65Y20) Numerical integration (65D30) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• scientific article; zbMATH DE number 1246413
• Recent developments in information-based complexity
• Computational complexity of continuous problems
• scientific article; zbMATH DE number 953052
• ABC on IBC

Cited in

(5)

• Perspectives on information-based complexity
• scientific article; zbMATH DE number 1859218 (Why is no real title available?)
• ABC on IBC
• Information-based complexity: New questions for mathematicians
• Guest editors' preface

This page was built for publication: Continuous problems: optimality, complexity, tractability (invited talk)

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