Parametrized uniform complexity of computation in geometry and numerics

DOI10.1007/978-94-017-9825-9MaRDI QIDQ5249735zbMATH OpenOpenAlexFDO

Authors Carsten Rösnick

Publication date 11 May 2015

Full work available at URL https://doi.org/10.1007/978-94-017-9825-9

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Complexity of computation (including implicit computational complexity) (03D15) Computation over the reals, computable analysis (03D78) Complexity and performance of numerical algorithms (65Y20) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Recommendations

• Parameterized complexity for uniform operators on multidimensional analytic functions and ODE solving
• Computational benefit of smoothness: parameterized bit-complexity of numerical operators on analytic functions and Gevrey's hierarchy
• Complexity theory for operators in analysis
• scientific article; zbMATH DE number 16658
• Complexity of operators on compact sets

Cited in

(2)

• scientific article; zbMATH DE number 5849947 (Why is no real title available?)
• scientific article; zbMATH DE number 16658 (Why is no real title available?)

This page was built for publication: Parametrized uniform complexity of computation in geometry and numerics

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