Similar Items: Handicap reduction for linear complementarity problems
- On Solving Problems of Substantially Super-linear Complexity in $N^{o(1)}$ Rounds in the MPC Model
- Learning-Augmented Scalable Linear Assignment Problem Optimization via Neural Dual Warm-Starts
- Variational and Majorization Principles in Lattice Reduction
- Solving Positive Linear Programs with Differential Privacy
- Towards Settling the Complexity of the Lettericity Problem
- Solving Hypergraph Laplacian Systems in Almost-Linear Time