No. Title Author Year
1 Efficient 1-Laplacian Solvers for Well-Shaped Simplicial Complexes: Beyond Betti Numbers and Collapsing Sequences Ding, Ming et al. 2023
2 Hardness Results for Laplacians of Simplicial Complexes via Sparse-Linear Equation Complete Gadgets Ding, Ming et al. 2022
3 Hardness Results for Weaver’s Discrepancy Problem Spielman, Daniel A. et al. 2022
4 Two-Commodity Flow Is Equivalent to Linear Programming Under Nearly-Linear Time Reductions Ding, Ming et al. 2022
5 A (1.4 + epsilon)-Approximation Algorithm for the 2-Max-Duo Problem Xu, Yao et al. 2017
6 Approximating the Solution to Mixed Packing and Covering LPs in Parallel O˜(epsilon^{-3}) Time Mahoney, Michael W. et al. 2016
Current Page :
Number of result pages: 1
Number of documents: 6

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI