Pages that link to "Item:Q845815"
From MaRDI portal
The following pages link to Parameterized complexity and improved inapproximability for computing the largest \(j\)-simplex in a \(V\)-polytope (Q845815):
Displaying 7 items.
- Polynomial-time approximation of largest simplices in \(V\)-polytopes. (Q1421471) (← links)
- \(\mathbb N\mathbb P\)-hardness of largest contained and smallest containing simplices for \(V\)- and \(H\)-polytopes (Q1849443) (← links)
- Largest \(j\)-simplices in \(n\)-polytopes (Q1892425) (← links)
- Exponential inapproximability of selecting a maximum volume sub-matrix (Q1939669) (← links)
- Column subset selection problem is UG-hard (Q2637653) (← links)
- Some Inapproximability Results of MAP Inference and Exponentiated Determinantal Point Processes (Q5076319) (← links)
- On the parameterized intractability of determinant maximization (Q6547207) (← links)
