Hardness results for structured linear systems

DOI10.1109/FOCS.2017.69MaRDI QIDQ6946317zbMATH OpenFDO

Authors Peng Zhang, Rasmus Kyng

Publication date 6 August 2025

Full work available at URL https://doi.org/10.1109/FOCS.2017.69

Mathematics Subject Classification ID

Theory of computing (68Qxx) Discrete mathematics in relation to computer science (68Rxx) Algorithms in computer science (68Wxx)

Cited in

(2)

• Solving sparse linear systems faster than matrix multiplication
• Optimal fine-grained hardness of approximation of linear equations

This page was built for publication: Hardness results for structured linear systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6946317)