Algorithms and hardness for linear algebra on geometric graphs

DOI10.1109/FOCS46700.2020.00057MaRDI QIDQ6943999zbMATH OpenFDO

Authors Aaron Schild, Timothy Chu, Zhao Song, Josh Alman

Publication date 12 August 2025

Full work available at URL https://doi.org/10.1109/FOCS46700.2020.00057

Mathematics Subject Classification ID

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

Cited in

(3)

• Finer-grained hardness of kernel density estimation
• Distance queries over dynamic interval graphs
• The complexity of non-stationary reinforcement learning

This page was built for publication: Algorithms and hardness for linear algebra on geometric graphs

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