Algorithmic Minimization of Non-zero Entries in 0,1-Matrices
Data(s) |
07/12/2009
07/12/2009
2007
|
---|---|
Resumo |
In this paper we present algorithms which work on pairs of 0,1- matrices which multiply again a matrix of zero and one entries. When applied over a pair, the algorithms change the number of non-zero entries present in the matrices, meanwhile their product remains unchanged. We establish the conditions under which the number of 1s decreases. We recursively define as well pairs of matrices which product is a specific matrix and such that by applying on them these algorithms, we minimize the total number of non-zero entries present in both matrices. These matrices may be interpreted as solutions for a well known information retrieval problem, and in this case the number of 1 entries represent the complexity of the retrieve and information update operations. |
Identificador |
1313-0463 |
Idioma(s) |
en |
Publicador |
Institute of Information Theories and Applications FOI ITHEA |
Palavras-Chave | #Zero-One Matrices #Analysis of Algorithms and Problem Complexity #Data Structures #Models of Computation |
Tipo |
Article |