Thuật toán tìm tất cả các rút gọn trong bảng quyết định

. Attribute reduction is one of the most important issues in rough set theory. There have been many scientific papers that suppose algorithms on attribute reduction. However, these algorithms are all heuristic which find the best attribute reduction based on a kind of heuristic information. In this paper, we present a new algorithm for finding all attribute reductions of a decision and we show that the time complexity of the algorithm is exponential in the number of attributes. We also show that this complexity is polynomial in many special cases.