Estimating the quality of computational algorithms. I
From MaRDI portal
Cites work
- APPROXIMATE DIMENSION AND BASES IN NUCLEAR SPACES
- DIAMETERS OF SETS IN FUNCTION SPACES AND THE THEORY OF BEST APPROXIMATIONS
- scientific article; zbMATH DE number 3142276 (Why is no real title available?)
- scientific article; zbMATH DE number 3215519 (Why is no real title available?)
- scientific article; zbMATH DE number 3346744 (Why is no real title available?)
- scientific article; zbMATH DE number 3389635 (Why is no real title available?)
- scientific article; zbMATH DE number 3054965 (Why is no real title available?)
- scientific article; zbMATH DE number 3078219 (Why is no real title available?)
- scientific article; zbMATH DE number 3089292 (Why is no real title available?)
- Various approaches to estimating the difficulty of approximate definition and computation of functions
- Über die beste Annäherung von Funktionen einer gegebenen Funktionenklasse
Cited in
(8)- A survey of information-based complexity
- Information complexity of equations of the second kind with compact operators in Hilbert space
- The problem of constructing unsaturated quadrature formulae on an interval
- Estimates of Alexandrov's \(n \)-width of the compact set of \(C^{\infty} \)-smooth functions on a finite segment
- Asymptotics for Alexandrov's n -width of a compact set of analytic periodic functions
- On the asymptotics of the Alexsandrov's n-width compact infinitely smooth periodic function of the Gevrey's class
- s-numbers in information-based complexity
- Optimal coding of elements of a metric space
This page was built for publication: Estimating the quality of computational algorithms. I
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1241012)
