The Null Space Problem I. Complexity
- 1 October 1986
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Algebraic Discrete Methods
- Vol. 7 (4) , 527-537
- https://doi.org/10.1137/0607059
Abstract
No abstract availableThis publication has 8 references indexed in Scilit:
- An algorithm to compute a sparse basis of the null spaceNumerische Mathematik, 1985
- The NP-completeness column: An ongoing guideJournal of Algorithms, 1985
- A Fast Algorithm that makes Matrices Optimally SparsePublished by Elsevier ,1984
- Large Sparse Numerical OptimizationLecture Notes in Computer Science, 1984
- Algorithms for Generating Fundamental Cycles in a GraphACM Transactions on Mathematical Software, 1982
- Decomposition of regular matroidsJournal of Combinatorial Theory, Series B, 1980
- Finding a Minimum Circuit in a GraphSIAM Journal on Computing, 1978
- Modules unimodulairesJournal of Combinatorial Theory, 1968