The candidate key of minimum cardinality problem was pointed out to be NP-complete in literature [1], [2], and [3].

• 文献[1]、[2]、[3]均明确指出，求一个关系模式的最小基数候选关键字问题是一个NP完全问题。