NP完全性理论中关于集合恰当覆盖的一个证明

Proof Concerning the Exact Set-cover of Theory of NP-completeness

NP完全性理论是国际上数学与计算机科学理论研究的新领域.本文证明了NP完全性理论中关于集合恰当覆盖的一个结论,充实了NPC理论中关于集合覆盖的论证.

The theory of NP-completeness is recently a new area in the study of mathematical and theoretical computer science in the world. A conclusion concerning the exact set-cover of the theory of NP-completeness is proved. It enriches the proof concerning the set-cover of theory of ATP-completeness.