Space Hardness of Solving Structured Linear Systems.

DOI10.4230/lipics.isaac.2020.56arXiv2003.06993OpenAlexW3118047993MaRDI QIDQ6065465

Xuangui Huang

Publication date: 14 November 2023

Full work available at URL: https://arxiv.org/abs/2003.06993

zbMATH Keywords

logarithmic spacethreshold circuitlinear system solver

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Efficient threshold circuits for power series
• Uniform constant-depth threshold circuits for division and iterated multiplication.
• The complexity of matrix rank and feasible systems of linear equations
• Pseudorandom walks on regular digraphs and the RL vs. L problem
• Nearly Linear Time Algorithms for Preconditioning and Solving Symmetric, Diagonally Dominant Linear Systems
• Powers of tensors and fast matrix multiplication
• On Threshold Circuits and Polynomial Computation
• On Relating Time and Space to Size and Depth
• Hardness Results for Structured Linear Systems
• Solving SDD linear systems in nearly m log ^1/2 n time
• Computational Complexity
• Inverting well conditioned matrices in quantum logspace

This page was built for publication: Space Hardness of Solving Structured Linear Systems.