Lower Bounds for Approximation by Nonlinear Manifolds
From MaRDI portal
Publication:5562739
DOI10.2307/1994937zbMath0174.35403MaRDI QIDQ5562739
Publication date: 1968
Full work available at URL: https://doi.org/10.2307/1994937
Related Items
Crossing patterns of segments, Refined bounds on the number of connected components of sign conditions on a variety, VC dimensions of principal component analysis, A size-depth trade-off for the analog computation of Boolean functions, Polynomial bounds for VC dimension of sigmoidal and general Pfaffian neural networks, On the computation of Boolean functions by analog circuits of bounded fan-in, An extension of Warren's lower bounds for approximations, Simple proofs of classical theorems in discrete geometry via the Guth-Katz polynomial partitioning technique, Simplices with given 2-face areas, Geometric properties of the ridge function manifold, Approximation of functional compact sets by analytic varieties, The maximum edit distance from hereditary graph properties, Edge intersection graphs of systems of paths on a grid with a bounded number of bends, An asymptotically tight bound on the number of semi-algebraically connected components of realizable sign conditions, Dynamical recognizers: real-time language recognition by analog computers, Bounding the number of connected components of a real algebraic set, The complexity of point configurations, The parallel complexity of function approximation, How to find Steiner minimal trees in Euclidean \(d\)-space, Generalized sum graphs, A combinatorial approach to complexity, The degree of approximation of sets in euclidean space using sets with bounded Vapnik-Chervonenkis dimension, Uniform approximation by neural networks, On best approximation by ridge functions, On the approximation of functional classes equipped with a uniform measure using ridge functions, Irrepresentability of short semilattices by Euclidean subspaces, Some combinatorial-algebraic problems from complexity theory, Stage-graph representations, On the value of partial information for learning from examples, On the number of sets definable by polynomials, Semialgebraic complexity of functions, Embeddings of graphs in Euclidean spaces, Not all graphs are segment \(T\)-graphs, Density and dimension, The geometry of critical and near-critical values of differentiable mappings, Systems of rational polynomial equations have polynomial size approximate zeros on the average, Bounding the Vapnik-Chervonenkis dimension of concept classes parameterized by real numbers, Weaving patterns of lines and line segments in space, On the Vapnik-Chervonenkis dimension of computer programs which use transcendental elementary operations, Pseudo-dimension and entropy of manifolds formed by affine-invariant dictionary, On the number of zero-patterns of a sequence of polynomials, On the Complexity of Computing and Learning with Multiplicative Neural Networks, Vapnik-Chervonenkis Dimension of Parallel Arithmetic Computations
Cites Work
