Finally, a polynomial time algorithm for solving an optimal cover of FD set is given.

• 最后给出了一个求FD集最优覆盖的多项式时间算法。