On the complexity of four polyhedral set containment problems
From MaRDI portal
Recommendations
- On the complexity of some basic problems in computational convexity. I. Containment problems
- On recognizing integer polyhedra
- Point containment in the integer hull of a polyhedron
- Sum of squares certificates for containment of \(\mathcal{H}\)-polytopes in \(\mathcal{V}\)-polytopes
- Containment problems for polytopes and spectrahedra
Cites work
Cited in
(36)- On the membership problem for the elementary closure of a polyhedron
- Mathematical programs with a two-dimensional reverse convex constraint
- On the complexity of approximating the maximal inscribed ellipsoid for a polytope
- Linear programs with an additional rank two reverse convex constraint
- On the complexity of some basic problems in computational convexity. I. Containment problems
- Inner and outer approximations of polytopes using boxes.
- Colorful linear programming, Nash equilibrium, and pivots
- Segments in enumerating faces
- Self-duality of polytopes and its relations to vertex enumeration and graph isomorphism
- Is a finite intersection of balls covered by a finite union of balls in Euclidean spaces?
- On the co-NP-completeness of the zonotope containment problem
- Outer-product-free sets for polynomial optimization and oracle-based cuts
- D.c sets, d.c. functions and nonlinear equations
- Computational complexity of inner and outer \(j\)-radii of polytopes in finite-dimensional normed spaces
- Which nonnegative matrices are slack matrices?
- Convex hulls, oracles, and homology
- Sum of squares certificates for containment of \(\mathcal{H}\)-polytopes in \(\mathcal{V}\)-polytopes
- Verification of Hybrid Systems
- Sharpening geometric inequalities using computable symmetry measures
- On the containment problem for linear sets
- Tight approximations of dynamic risk measures
- scientific article; zbMATH DE number 4053349 (Why is no real title available?)
- Novel approaches to the discrimination problem
- Spherical coverage verification
- Deterministic and randomized polynomial‐time approximation of radii
- Some recent developments in spectrahedral computation
- Finding minimum volume circumscribing ellipsoids using generalized copositive programming
- Sparse probability assessment heuristic based on orthogonal matching pursuit
- A matrix Positivstellensatz with lifting polynomials
- A semidefinite hierarchy for containment of spectrahedra
- On the implementation and strengthening of intersection cuts for QCQPs
- On a cone covering problem
- Learning Topic Models: Identifiability and Finite-Sample Analysis
- The computational complexity of the weak gravity conjecture
- Computational complexity of norm-maximization
- On the hardness of computing intersection, union and Minkowski sum of polytopes
This page was built for publication: On the complexity of four polyhedral set containment problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3703587)
