Space Hardness of Solving Structured Linear Systems
Computational Complexity
2020-03-17 v1
Abstract
We show that if the probabilistic logarithmic-space solver or the deterministic nearly logarithmic-space solver for undirected Laplacian matrices can be extended to solve slightly larger subclasses of linear systems, then they can be use to solve all linear systems with similar space complexity. Previously Kyng and Zhang proved similar results in the time complexity setting using reductions between approximate solvers. We prove that their reductions can be implemented using constant-depth, polynomial-size threshold circuits.
Cite
@article{arxiv.2003.06993,
title = {Space Hardness of Solving Structured Linear Systems},
author = {Xuangui Huang},
journal= {arXiv preprint arXiv:2003.06993},
year = {2020}
}