Pages that link to "Item:Q1849443"
From MaRDI portal
The following pages link to \(\mathbb N\mathbb P\)-hardness of largest contained and smallest containing simplices for \(V\)- and \(H\)-polytopes (Q1849443):
Displaying 11 items.
- Deciding uniqueness in norm maximazation (Q687086) (← links)
- On statistical learning of simplices: unmixing problem revisited (Q820821) (← links)
- Parameterized complexity and improved inapproximability for computing the largest \(j\)-simplex in a \(V\)-polytope (Q845815) (← links)
- Polynomial-time approximation of largest simplices in \(V\)-polytopes. (Q1421471) (← links)
- Finding optimal shadows of polytopes (Q1580746) (← links)
- Largest \(j\)-simplices in \(n\)-polytopes (Q1892425) (← links)
- The integrality number of an integer program (Q2118127) (← links)
- Sum of squares certificates for containment of \(\mathcal{H}\)-polytopes in \(\mathcal{V}\)-polytopes (Q2804545) (← links)
- Maximum Volume Inscribed Ellipsoid: A New Simplex-Structured Matrix Factorization Framework via Facet Enumeration and Convex Optimization (Q4689774) (← links)
- Toward Quantifying Vertex Similarity in Networks (Q4985357) (← links)
- A new convex model for linear hyperspectral unmixing (Q6145222) (← links)
