Pages that link to "Item:Q5002639"
From MaRDI portal
The following pages link to On the Complexity of Constrained Determinantal Point Processes (Q5002639):
Displaying 4 items.
- Spanning tree constrained determinantal point processes are hard to (approximately) evaluate (Q2060533) (← links)
- Subdeterminant Maximization via Nonconvex Relaxations and Anti-Concentration (Q3387758) (← links)
- Ranking with Fairness Constraints (Q5002698) (← links)
- Stability and complexity of mixed discriminants (Q5207439) (← links)
