Abstract
Algorithmic aspects of the problem of minimizing the set of attributes in an information system are considered. Two simplifications of this problem are proved to be NP-complete. A simple heuristic algorithm is presented and analyzed.
Get full access to this article
View all access options for this article.