Incomplete nested dissection
From MaRDI portal
Publication:5230306
DOI10.1145/3188745.3188960OpenAlexW2963423025MaRDI QIDQ5230306
No author found.
Publication date: 22 August 2019
Published in: Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1805.09442
Related Items (2)
Hardness of graph-structured algebraic and symbolic problems ⋮ Hardness Results for Structured Linear Systems
This page was built for publication: Incomplete nested dissection