Hardness of Graph-Structured Algebraic and Symbolic Problems

Download PDF
Open Webpage

Jingbang Chen, Yu Gao, Yufan Huang, Richard Peng, Runze Wang

Published: 01 Jan 2023, Last Modified: 05 Feb 2025WADS 2023EveryoneRevisionsBibTeXCC BY-SA 4.0
Abstract: In this paper, we study the hardness of solving graph-structured linear systems with coefficients over a finite field \(\mathbb {Z}_p\) and over a polynomial ring \(\mathbb {F}[x_1,\ldots ,x_t]\).