Pages that link to "Item:Q845815"

The following pages link to Parameterized complexity and improved inapproximability for computing the largest \(j\)-simplex in a \(V\)-polytope (Q845815):

Displaying 3 items.

• 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)