Semialgebraic complexity of functions
From MaRDI portal
Publication:1763427
DOI10.1016/j.jco.2003.09.005zbMath1101.68614OpenAlexW1969055832MaRDI QIDQ1763427
Publication date: 22 February 2005
Published in: Journal of Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jco.2003.09.005
Related Items
Linear versus non-linear acquisition of step-functions ⋮ Smooth parametrizations in dynamics, analysis, diophantine and computational geometry ⋮ Uniform approximation of near-singular surfaces ⋮ Analytic reparametrization of semi-algebraic sets ⋮ Sampling, Metric Entropy, and Dimensionality Reduction
Cites Work
- 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
- On singularities of mappings of Euclidean spaces. I. Mappings of the plane into the plane
- Images of critical sets
- Global bounds for the Betti numbers of regular fibers of differentiable mappings
- Volume growth and entropy
- \(C^ k\)-resolution of semialgebraic mappings, addendum to volume growth and entropy
- On representation of functions by means of superpositions and related topics
- Complexity of functions: Some questions, conjectures, and results
- On the inverse function theorem
- Singularities of the maximum of a parametrically dependent function
- On the \(\varepsilon\)-entropy of nearly critical values
- Flexible high-order discretization of geometric data for global motion planning
- Tame geometry with application in smooth analysis
- Critical and near-critical values in polynomial control problems. I: One- dimensional case
- The geometry of critical and near-critical values of differentiable mappings
- Numerical solution of field problems by nonconforming Taylor discretization
- Computational Complexity: On the Geometry of Polynomials and a Theory of Cost: II
- On Functions Representable as a Supremum of a Family of Smooth Functions
- The Set of Zeroes of an "Almost Polynomial" Function
- Computational complexity. On the geometry of polynomials and a theory of cost. I
- On Functions Representable As a Supremum of a Family of Smooth Functions II
- Critical Values and Representation of Functions by Means of Compositions
- Local complexity growth for iterations of real analytic mappings and semicontinuity moduli of the entropy
- Generalized Gradients and Applications
- Modified algorithms for nonconforming taylor discretization
- Max-plack-institut fiir mathematik
- From formal numerical solutions of elliptic PDE's to the true ones
- An Infinite Dimensional Version of Sard's Theorem
- KOLMOGOROV'S WORK ON $ \varepsilon$-ENTROPY OF FUNCTIONAL CLASSES AND THE SUPERPOSITION OF FUNCTIONS
- Metric entropy and approximation
- Lower Bounds for Approximation by Nonlinear Manifolds
- Counterexample to the Morse-Sard Theorem in the Case of Infinite-Dimensional Manifolds
- Approximation par des variétés algébriques dans les espaces hilbertiens (Variation sur un thème de Vituškin)
- The measure of the critical values of differentiable maps
