Summary: Several strategies for the minimal attribute reduction with polynomial time complexity \((O(n^k))\) have been developed in rough set theory. Are they complete? While investigating the attribute reduction strategy based on the discernibility matrix (DM), a counterexample is constructed theoretically, which demonstrates that these strategies are all incomplete with respect to the minimal reduction.