A note on the set basis problem related to the compaction of character sets-Reference-Cited by-同舟云学术

A note on the set basis problem related to the compaction of character sets

Published:1975-11 Issue:11 Volume:18 Page:656-657
ISSN:0001-0782
Container-title:Communications of the ACM
language:en
Short-container-title:Commun. ACM

Author:

Kou Lawrence T.¹,Wong C. K.¹

Affiliation:

1. IBM Thomas Watson Research Center, Yorktown Heights, NY

Abstract

This note discusses the reduction of the set basis problem to the clique cover problem.

Publisher

Association for Computing Machinery (ACM)

Subject

General Computer Science

Link

https://dl.acm.org/doi/pdf/10.1145/361219.361225

Reference4 articles.

1. Block H.D. Nilsson N.J. and Duda R.O. Determination and detection of features in patterns In Computer and information Sciences J. T. Tou and R. H. Wilcox (Eds.) Spartan Books Washington D.C. 1964 pp. 75-110. Block H.D. Nilsson N.J. and Duda R.O. Determination and detection of features in patterns In Computer and information Sciences J. T. Tou and R. H. Wilcox (Eds.) Spartan Books Washington D.C. 1964 pp. 75-110.

2. The minimization of spatially-multiplexed character sets

3. Reducibility among Combinatorial Problems

4. Stockmeyer L. J. The minimal set basis problem is NP-complete. IBM Research Rep. RC 5431 May 1975. Stockmeyer L. J. The minimal set basis problem is NP-complete. IBM Research Rep. RC 5431 May 1975.

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Bitlist;Proceedings of the VLDB Endowment;2013-08-29

2. Optimal grouping of components in a distributed system;Computer Communications;1998-10

3. A class of linear maps for error corrective dimensionality reduction of binary templates;Pattern Recognition;1988-01

4. Finding Augmented-Set Bases;SIAM Journal on Computing;1982-08