scientific article; zbMATH DE number 1313392
From MaRDI portal
Publication:4254915
zbMath0933.46013MaRDI QIDQ4254915
Publication date: 4 July 1999
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lattices and convex bodies in (n) dimensions (aspects of discrete geometry) (52C07) Geometry and structure of normed linear spaces (46B20) Research exposition (monographs, survey articles) pertaining to functional analysis (46-02) Convex sets in (n) dimensions (including convex hypersurfaces) (52A20) Research exposition (monographs, survey articles) pertaining to convex and discrete geometry (52-02)
Related Items (29)
Orbit Point of View on Some Results of Asymptotic Theory; Orbit Type and Cotype ⋮ Carl's inequality for quasi-Banach spaces ⋮ On the proliferation of support vectors in high dimensions* ⋮ Explicit lower and upper bounds on the entangled value of multiplayer XOR games ⋮ Gelfand numbers of operators with values in a Hilbert space ⋮ Stochastic reverse isoperimetric inequalities in the plane ⋮ On the volume of unit balls of finite-dimensional Lorentz spaces ⋮ \(s\)-numbers of shift operators of formal entire functions ⋮ The smallest singular value of a shifted random matrix ⋮ The structure of translation-invariant spaces on locally compact abelian groups ⋮ Estimating the probability that a given vector is in the convex hull of a random sample ⋮ A reduction of the slicing problem to finite volume ratio bodies. ⋮ Time for dithering: fast and quantized random embeddings via the restricted isometry property ⋮ A generalized Grothendieck inequality and nonlocal correlations that require high entanglement ⋮ Semidefinite Approximation of Closed Convex Set ⋮ On Kernel Method–Based Connectionist Models and Supervised Deep Learning Without Backpropagation ⋮ Unnamed Item ⋮ Entropy numbers of finite-dimensional embeddings ⋮ Model selection for simplicial approximation ⋮ Random variables in weak type \(p\) spaces ⋮ Some lower bounds on sparse outer approximations of polytopes ⋮ Deterministic and randomized polynomial‐time approximation of radii ⋮ The accessibility of convex bodies and derandomization of the hit and run algorithm ⋮ Uniform recovery of fusion frame structured sparse signals ⋮ Three-space problems for the approximation property ⋮ Tail bounds for gaps between eigenvalues of sparse random matrices ⋮ Unnamed Item ⋮ Nonlinear methods for model reduction ⋮ A polynomial time approximation scheme for computing the supremum of Gaussian processes
This page was built for publication:
