Dynamic matrix inverse: improved algorithms and matching conditional lower bounds

DOI10.1109/FOCS.2019.00036MaRDI QIDQ6944201zbMATH OpenFDO

Authors Jan van Den Brand, Danupon Nanongkai, Thatchaphol Saranurak

Publication date 12 August 2025

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

Mathematics Subject Classification ID

Proceedings, conferences, collections, etc. pertaining to computer science (68-06)

Cited in

(9)

• Fully dynamic strongly connected components in planar digraphs
• The bit complexity of dynamic algebraic formulas and their determinants
• The NFA acceptance hypothesis: non-combinatorial and dynamic lower bounds
• Conditional lower bounds for dynamic geometric measure problems
• Conditional lower bounds for dynamic geometric measure problems
• Dynamic matching with better-than-2 approximation in polylogarithmic update time
• Constructing a distance sensitivity oracle in \(O(n^{2.5794}M)\) time
• Acceleration meets inverse maintenance: faster _-regression
• Decremental (1+)-approximate maximum eigenvector: dynamic power method

This page was built for publication: Dynamic matrix inverse: improved algorithms and matching conditional lower bounds

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