Pages that link to "Item:Q2368077"
From MaRDI portal
The following pages link to Computational complexity of inner and outer \(j\)-radii of polytopes in finite-dimensional normed spaces (Q2368077):
Displaying 29 items.
- Successive radii and Minkowski addition (Q431178) (← links)
- Minimal containment under homothetics: a simple cutting plane approach (Q535290) (← links)
- On clustering bodies: geometry and polyhedral approximation (Q603849) (← links)
- Efficient subspace approximation algorithms (Q664540) (← links)
- Deciding uniqueness in norm maximazation (Q687086) (← links)
- Computational complexity of norm-maximization (Q757258) (← links)
- Fitting enclosing cylinders to data in \(\mathbb R^n\) (Q861741) (← links)
- Intrinsic volumes and successive radii (Q924207) (← links)
- Inner and outer \(j\)-radii of convex bodies in finite-dimensional normed spaces (Q1182991) (← links)
- Polynomial-time approximation of largest simplices in \(V\)-polytopes. (Q1421471) (← links)
- Inner and outer approximations of polytopes using boxes. (Q1428115) (← links)
- Successive radii and ball operators in generalized Minkowski spaces (Q1707402) (← links)
- On computing the diameter of a point set in high dimensional Euclidean space. (Q1853493) (← links)
- Largest \(j\)-simplices in \(n\)-polytopes (Q1892425) (← links)
- Note on the computational complexity of \(j\)-radii of polytopes in \(\mathbb R^ n\) (Q1915805) (← links)
- Largest \(j\)-simplices in \(d\)-cubes: Some relatives of the Hadamard maximum determinant problem (Q1923163) (← links)
- No dimension-independent core-sets for containment under homothetics (Q1942308) (← links)
- Computing the discrete compactness of orthogonal pseudo-polytopes via their \(n\)D-EVM representation (Q1958864) (← links)
- Complexity yardsticks for \(f\)-vectors of polytopes and spheres (Q2197688) (← links)
- Calculus of fuzzy vector-valued functions and almost periodic fuzzy vector-valued functions on time scales (Q2329045) (← links)
- Fixed-parameter complexity and approximability of norm maximization (Q2340407) (← links)
- A note on approximation of a ball by polytopes (Q2386205) (← links)
- Sum of squares certificates for containment of \(\mathcal{H}\)-polytopes in \(\mathcal{V}\)-polytopes (Q2804545) (← links)
- SHARPENING GEOMETRIC INEQUALITIES USING COMPUTABLE SYMMETRY MEASURES (Q3195358) (← links)
- APPROXIMATING SMALLEST ENCLOSING BALLS WITH APPLICATIONS TO MACHINE LEARNING (Q3647614) (← links)
- Deterministic and randomized polynomial‐time approximation of radii (Q4435530) (← links)
- A Semidefinite Hierarchy for Containment of Spectrahedra (Q5254998) (← links)
- Radii minimal projections of polytopes and constrained optimization of symmetric polynomials (Q5488627) (← links)
- Diversities and the generalized circumradius (Q6142370) (← links)
