Complexity of functions: Some questions, conjectures, and results
From MaRDI portal
Publication:1174450
DOI10.1016/0885-064X(91)90045-YzbMath0759.41022WikidataQ123007983 ScholiaQ123007983MaRDI QIDQ1174450
Publication date: 25 June 1992
Published in: Journal of Complexity (Search for Journal in Brave)
Related Items (5)
Flexible high-order discretization of geometric data for global motion planning ⋮ Linear versus non-linear acquisition of step-functions ⋮ Uniform approximation of near-singular surfaces ⋮ Analytic reparametrization of semi-algebraic sets ⋮ Semialgebraic complexity of functions
Cites Work
- A Mathematical Theory of Communication
- Global bounds for the Betti numbers of regular fibers of differentiable mappings
- On the Kolmogorov complexity of functions of finite smoothness
- Homeomorphisms of an interval and smoothness of a function
- Volume growth and entropy
- On the worst-case arithmetic complexity of approximating zeros of polynomials
- A probabilistic theory for error estimation in automatic integration
- On representation of functions by means of superpositions and related topics
- Variational properties of averaged equations for periodic media
- Flexible high-order discretization of geometric data for global motion planning
- The geometry of critical and near-critical values of differentiable mappings
- On Functions Representable as a Supremum of a Family of Smooth Functions
- Optimum Sequential Search and Approximation Methods Under Minimum Regularity Assumptions
- On Functions Representable As a Supremum of a Family of Smooth Functions II
- On the Worst-Case Arithmetic Complexity of Approximating Zeros of Systems of Polynomials
- On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
- Representation of continuous functions of three variables by the superposition of continuous functions of two variables
- On the representation of continuous functions of many variables by superposition of continuous functions of one variable and addition
- KOLMOGOROV'S WORK ON $ \varepsilon$-ENTROPY OF FUNCTIONAL CLASSES AND THE SUPERPOSITION OF FUNCTIONS
- THE COMPLEXITY OF FINITE OBJECTS AND THE DEVELOPMENT OF THE CONCEPTS OF INFORMATION AND RANDOMNESS BY MEANS OF THE THEORY OF ALGORITHMS
- On optimal methods of specifying information during the solution of differential equations
- Best Approximate Integration Formulas; Best Approximation Formulas
- The measure of the critical values of differentiable maps
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Complexity of functions: Some questions, conjectures, and results