“set cover algorithm”的概念、定义、翻译、参考文献-科学参考

单词	set cover algorithm
释义	set cover algorithm Encyclopedia 理学组合算法释 set cover algorithm集合覆盖算法集合覆盖算法是求解集合覆盖问题的算法。集合覆盖问题（set cover problem，简称SCP）是计算机科学、组合数学以及计算复杂性理论中的重要问题。集合覆盖问题的形式化定义如下：给定一个全集以及集合,其中，覆盖（cover）是指一个集合，其中且包含的所有元素的并集为；集合覆盖的判定（Decision）问题为：给定和以及整数，判断是否存在势（Cardinality）小于或者等于的覆盖；集合覆盖的优化（Optimization）问题为：给定和，求一个势最小的覆盖。
随便看	murals in tomb of Feng Daozhen Murals in Tomb of Han Dynasty in Shaogou murals in tomb of Han Shixun murals in tomb of Jin dynasty in Pingding county murals in tomb of Zhuang Kuangzheng murals in tombs of Han Dynasty Murals in Vairocara Temple Murals in Xinghua Temple Murals in Yanshan Temple Murals of Helingeer Han Tomb Murals of Northern Dynasties at Wanzhang in Cixian Murals of the Liao Dynasty tombs at Baoshan Murals of the Taiping Heavenly Kingdom Murals of Tomb of Han Dynasty in Yingchengzi murals of Zaju Opera of the Mingying Wang Hall in Hongdong County murals on music and dance performances of Su Sixu’s tomb murals on the Astana-Karakhoja ancient tombs of the Tang Dynasty murals on the dramatic stage of the Dongyue Temple in Liaotian Village Murals Tombs of Wei,Jin and Sixteen Kingdoms Period in Hexi Corridor Mural Tomb at Nanwuli Mural Tomb at Shaling of Northern Wei Dynasty Mural Tomb of Bohai State at Ning’an Mural Tomb of Eastern Han Dynasty at Qushuhao Mural Tomb of Han Dynasty at Horinger Mural Tomb of Han Dynasty at Liangshan

科学参考收录了854744条科技类词条，基本涵盖了常见科技类参考文献及英语词汇的翻译，是科学学习和研究的有利工具。