共 50 条
- [31] Relaxed Locally Correctable Codes with Nearly-Linear Block Length and Constant Query Complexity PROCEEDINGS OF THE THIRTY-FIRST ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS (SODA'20), 2020, : 1395 - 1411
- [32] Nested Dissection Meets IPMs: Planar Min-Cost Flow in Nearly-Linear Time PROCEEDINGS OF THE 2022 ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, SODA, 2022, : 124 - 153
- [35] On the Difference Between Closest, Furthest, and Orthogonal Pairs: Nearly-Linear vs Barely-Subquadratic Complexity SODA'18: PROCEEDINGS OF THE TWENTY-NINTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2018, : 1207 - 1215
- [38] Nearly-Linear Work Parallel SDD Solvers, Low-Diameter Decomposition, and Low-Stretch Subgraphs Theory of Computing Systems, 2014, 55 : 521 - 554
- [39] Quantum Properties of the Superposition of Two Nearly Identical Coherent States International Journal of Theoretical Physics, 2018, 57 : 2293 - 2308