Pages that link to "Item:Q3703587"
From MaRDI portal
The following pages link to On the complexity of four polyhedral set containment problems (Q3703587):
Displayed 31 items.
- Spherical coverage verification (Q440948) (← links)
- On a cone covering problem (Q617540) (← links)
- Computational complexity of norm-maximization (Q757258) (← links)
- On the hardness of computing intersection, union and Minkowski sum of polytopes (Q958243) (← links)
- Mathematical programs with a two-dimensional reverse convex constraint (Q1186268) (← links)
- On the complexity of approximating the maximal inscribed ellipsoid for a polytope (Q1315411) (← links)
- Linear programs with an additional rank two reverse convex constraint (Q1327432) (← links)
- On the complexity of some basic problems in computational convexity. I. Containment problems (Q1344616) (← links)
- Inner and outer approximations of polytopes using boxes. (Q1428115) (← links)
- Colorful linear programming, Nash equilibrium, and pivots (Q1707915) (← links)
- Segments in enumerating faces (Q1904658) (← links)
- Self-duality of polytopes and its relations to vertex enumeration and graph isomorphism (Q2014726) (← links)
- Is a finite intersection of balls covered by a finite union of balls in Euclidean spaces? (Q2025288) (← links)
- Outer-product-free sets for polynomial optimization and oracle-based cuts (Q2196293) (← links)
- D.c sets, d.c. functions and nonlinear equations (Q2367918) (← links)
- Computational complexity of inner and outer \(j\)-radii of polytopes in finite-dimensional normed spaces (Q2368077) (← links)
- Which nonnegative matrices are slack matrices? (Q2435500) (← links)
- Convex hulls, oracles, and homology (Q2643561) (← links)
- Sum of Squares Certificates for Containment of $\mathcal{H}$-Polytopes in $\mathcal{V}$-Polytopes (Q2804545) (← links)
- Verification of Hybrid Systems (Q3176388) (← links)
- SHARPENING GEOMETRIC INEQUALITIES USING COMPUTABLE SYMMETRY MEASURES (Q3195358) (← links)
- Tight Approximations of Dynamic Risk Measures (Q3449453) (← links)
- Novel approaches to the discrimination problem (Q4031377) (← links)
- Deterministic and randomized polynomial‐time approximation of radii (Q4435530) (← links)
- Some Recent Developments in Spectrahedral Computation (Q4556598) (← links)
- Finding Minimum Volume Circumscribing Ellipsoids Using Generalized Copositive Programming (Q5058050) (← links)
- Sparse Probability Assessment Heuristic Based on Orthogonal Matching Pursuit (Q5121287) (← links)
- A Matrix Positivstellensatz with Lifting Polynomials (Q5210520) (← links)
- A Semidefinite Hierarchy for Containment of Spectrahedra (Q5254998) (← links)
- On the implementation and strengthening of intersection cuts for QCQPs (Q5925638) (← links)
- Learning Topic Models: Identifiability and Finite-Sample Analysis (Q6185581) (← links)