scientific article; zbMATH DE number 139637
From MaRDI portal
Publication:4029617
zbMATH Open0779.41007MaRDI QIDQ4029617FDOQ4029617
Authors: S. B. Gashkov 
Publication date: 28 March 1993
Title of this publication is not available (Why is that?)
Recommendations
- scientific article; zbMATH DE number 850399
- Complexity of approximate realizations of Lipschitz functions by schemes in continuous bases
- scientific article; zbMATH DE number 4046332
- Complexity of approximate realization of functions, satisfying the Lipschitz condition, by schemes in continuous bases
- scientific article; zbMATH DE number 1166265
Analysis of algorithms and problem complexity (68Q25) Approximation by other special function classes (41A30)
Cited In (15)
- Complexity of approximate realizations of Lipschitz functions by schemes in continuous bases
- On the time complexity of partial real functions
- On the complexity of approximate realization for classes of functions of several variables by schemes and formulas in bases of continuous functions
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the upper bounds for complexities of discrete functions
- Towards Computational Complexity Theory on Advanced Function Spaces in Analysis
- Title not available (Why is that?)
- Approximation of continuous functions by finite automata
- Title not available (Why is that?)
- Lower bound on complexity of optimization of continuous functions
- Complexity of approximate realization of functions, satisfying the Lipschitz condition, by schemes in continuous bases
- Estimates of the complexity of approximation of continuous functions in some classes of determinate functions with delay
- On the Computational Complexity of Positive Linear Functionals on $$\mathcal{C}[0;1]$$
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4029617)
