Now showing items 1-3 of 3

• #### The Null Space Problem II: Algorithms ﻿

(Cornell University, 1986-04)
The Null Space Problem is that of finding a sparsest basis for the null space (null basis) of a $t \times n$ matrix of rank $t$. This problem was shown to be NP-hard in Coleman and Pothen (1985). In this paper we develop ...
• #### Sparse Null Bases and Marriage Theorems ﻿

(Cornell University, 1985-05)
ABSTRACT NOT SUPPLIED
• #### The Sparse Null Space Basis Problem ﻿

(Cornell University, 1984-07)
The sparse null space basis problem is the following: $A t \times n$ matrix $A (t less than n)$ is given. Find a matrix $N$, with the fewest nonzero entries in it, whose columns span the null space of $A$. This problem ...