Abstract:
The available formal methods to study large data arrays rely on processing completely filled out rectangular tables. The paper poses the problem of developing formal methods for studying tables with a many entries missing. With two problems of determining the structure of an array as examples it is shown that a numerical array with random distribution of missing entries is equally applicable as is a rectanguat matrix with the same number of known elements.