Pages that link to "Item:Q5562739"
From MaRDI portal
The following pages link to Lower Bounds for Approximation by Nonlinear Manifolds (Q5562739):
Displaying 50 items.
- Intersection graphs of L-shapes and segments in the plane (Q277615) (← links)
- Improved enumeration of simple topological graphs (Q377494) (← links)
- Refined bounds on the number of connected components of sign conditions on a variety (Q411399) (← links)
- Incidences between points and lines in \({\mathbb {R}}^4\) (Q527445) (← links)
- VC dimensions of principal component analysis (Q603853) (← links)
- A size-depth trade-off for the analog computation of Boolean functions (Q671617) (← links)
- Polynomial bounds for VC dimension of sigmoidal and general Pfaffian neural networks (Q676431) (← links)
- On the computation of Boolean functions by analog circuits of bounded fan-in (Q676434) (← links)
- An extension of Warren's lower bounds for approximations (Q686108) (← links)
- Simple proofs of classical theorems in discrete geometry via the Guth-Katz polynomial partitioning technique (Q714991) (← links)
- Simplices with given 2-face areas (Q757443) (← links)
- Geometric properties of the ridge function manifold (Q849339) (← links)
- Approximation of functional compact sets by analytic varieties (Q880109) (← links)
- Space lower bounds for low-stretch greedy embeddings (Q896692) (← links)
- Optimal social choice functions: a utilitarian view (Q899165) (← links)
- The maximum edit distance from hereditary graph properties (Q933672) (← links)
- Edge intersection graphs of systems of paths on a grid with a bounded number of bends (Q967371) (← links)
- An asymptotically tight bound on the number of semi-algebraically connected components of realizable sign conditions (Q987564) (← links)
- Dynamical recognizers: real-time language recognition by analog computers (Q1129007) (← links)
- Bounding the number of connected components of a real algebraic set (Q1174716) (← links)
- The complexity of point configurations (Q1175788) (← links)
- The parallel complexity of function approximation (Q1179031) (← links)
- How to find Steiner minimal trees in Euclidean \(d\)-space (Q1186793) (← links)
- Generalized sum graphs (Q1187945) (← links)
- A combinatorial approach to complexity (Q1196691) (← links)
- The degree of approximation of sets in euclidean space using sets with bounded Vapnik-Chervonenkis dimension (Q1265746) (← links)
- Uniform approximation by neural networks (Q1273409) (← links)
- On best approximation by ridge functions (Q1300146) (← links)
- On the approximation of functional classes equipped with a uniform measure using ridge functions (Q1300147) (← links)
- Irrepresentability of short semilattices by Euclidean subspaces (Q1333298) (← links)
- Some combinatorial-algebraic problems from complexity theory (Q1344621) (← links)
- Stage-graph representations (Q1363763) (← links)
- On the value of partial information for learning from examples (Q1383444) (← links)
- On the number of sets definable by polynomials (Q1569817) (← links)
- An LP-based \(k\)-means algorithm for balancing weighted point sets (Q1694906) (← links)
- Implicit representation conjecture for semi-algebraic graphs (Q1735676) (← links)
- Semialgebraic complexity of functions (Q1763427) (← links)
- Embeddings of graphs in Euclidean spaces (Q1812683) (← links)
- Not all graphs are segment \(T\)-graphs (Q1813624) (← links)
- Density and dimension (Q1836212) (← links)
- The geometry of critical and near-critical values of differentiable mappings (Q1837435) (← links)
- Systems of rational polynomial equations have polynomial size approximate zeros on the average (Q1869964) (← links)
- Bounding the Vapnik-Chervonenkis dimension of concept classes parameterized by real numbers (Q1900973) (← links)
- On the number of order types in integer grids of small size (Q1984592) (← links)
- Polyhedral circuits and their applications (Q2039640) (← links)
- Many order types on integer grids of polynomial size (Q2096371) (← links)
- Matrix and tensor rigidity and \(L_p\)-approximation (Q2145080) (← links)
- Decomposing arrangements of hyperplanes: VC-dimension, combinatorial dimension, and point location (Q2189742) (← links)
- Eliminating depth cycles among triangles in three dimensions (Q2207590) (← links)
- On the speed of algebraically defined graph classes (Q2227284) (← links)
