The minimization of spatially-multiplexed character sets
Communications of the ACM
Bitlist: new full-text index for low space cost and efficient keyword search
Proceedings of the VLDB Endowment
Hi-index | 48.22 |
This note discusses the reduction of the set basis problem to the clique cover problem.