Author:
Gottlieb Lee-Ad,Neylon Tyler
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,General Computer Science
Reference43 articles.
1. Amaldi, E., Kann, V.: The complexity and approximability of finding maximum feasible subsystems of linear relations. Theor. Comput. Sci. 147(1–2), 181–210 (1995)
2. Arora, S., Babai, L., Stern, J., Sweedyk, Z.: The hardness of approximate optima in lattices, codes and linear equations. J. Comput. Syst. Sci. 54(2), 317–331 (1997)
3. Berman, Piotr., Karpinski, Marek.: Approximating minimum unsatisfiability of linear equations. In: Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA ’02, pp. 514–516. Society for Industrial and Applied Mathematics (2002)
4. Berry, M., Heath, M., Kaneko, I., Lawo, M., Plemmons, R., Ward, R.: An algorithm to compute a sparse basis of the null space. Numer. Math. 47(4), 483–504 (1985)
5. Brualdi, R.A., Friedland, S., Pothen, A.: The sparse basis problem and multilinear algebra. SIAM J. Matrix Anal. Appl. 16(1), 1–20 (1995)
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献