Answers are grounded in this paper and cite their sources.
In this article we study the difficulty of solving Multiple Right-Hand Side (MRHS) equation systems. In the first part we show that, in general, solving MRHS systems is NP-hard. In the next part we focus on special (large) families of MRHS systems that can be solved in polynomial time with two algorithms: one based on linearisation of MRHS equations, and the second one based on decoding problems that can be solved in polynomial time.
No takes yet. Share an insight, caveat, or question.
Pavol Zajac (2016) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: