Hang-Yip Liu, Steffen Schulze, et al.
Proceedings of SPIE - The International Society for Optical Engineering
We present a fast algorithm for solving m X n systems of linear equations A x = c with at most two variables per equation. The algorithm makes use of a linear-time algorithm for constructing a spanning forest of an undirected graph, and it requires 5m + 2n - 2 arithmetic operations in the worst case. © 1980.
Hang-Yip Liu, Steffen Schulze, et al.
Proceedings of SPIE - The International Society for Optical Engineering
David Cash, Dennis Hofheinz, et al.
Journal of Cryptology
Paul J. Steinhardt, P. Chaudhari
Journal of Computational Physics
Ehud Altman, Kenneth R. Brown, et al.
PRX Quantum