A note on the set basis problem related to the compaction of character sets
- 1 November 1975
- journal article
- Published by Association for Computing Machinery (ACM) in Communications of the ACM
- Vol. 18 (11) , 656-657
- https://doi.org/10.1145/361219.361225
Abstract
This note discusses the reduction of the set basis problem to the clique cover problem.Keywords
This publication has 2 references indexed in Scilit:
- The minimization of spatially-multiplexed character setsCommunications of the ACM, 1974
- Reducibility among Combinatorial ProblemsPublished by Springer Nature ,1972