Similar Items: Exact Dynamic Programming for Solow--Polasky Diversity Subset Selection on Lines and Staircases
- Maximum Solow--Polasky Diversity Subset Selection Is NP-hard Even in the Euclidean Plane
- Exact and Approximate Algorithms for Polytree Learning
- Robust Inverse Quadratic Error Decay with Meshing and Beam Search for Random Subset Sum
- An Exact 56-Addition, Rank-23 Scheme for General 3*3 Matrix Multiplication
- Solving Positive Linear Programs with Differential Privacy
- Dynamic Detours