| NP完全性理论中关于集合恰当覆盖的一个证明 |
| |
| 引用本文： | 石凤仙.NP完全性理论中关于集合恰当覆盖的一个证明[J].东华大学学报(自然科学版),1997(4). |
| |
| 作者姓名： | 石凤仙 |
| |
| 作者单位： | 上海电力学院基础科学部!上海200090 |
| |
| 摘 要： | NP完全性理论是国际上数学与计算机科学理论研究的新领域.本文证明了NP完全性理论中关于集合恰当覆盖的一个结论,充实了NPC理论中关于集合覆盖的论证.
|
| 关 键 词： | NP Np_C 恰当覆盖 匹配 X4C 4DM nDM XnC |
Proof Concerning the Exact Set-cover of Theory of NP-completeness |
| |
| Shi Fengxian.Proof Concerning the Exact Set-cover of Theory of NP-completeness[J].Journal of Donghua University,1997(4). |
| |
| Authors: | Shi Fengxian |
| |
| Abstract: | 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. |
| |
| Keywords: | NP NP_C exact cover matching X4C 4DM nDM XnC |
| 本文献已被 CNKI 等数据库收录！ |
