“集合覆盖算法”的概念、定义、翻译、参考文献-科学参考

单词	集合覆盖算法
释义	集合覆盖算法 Encyclopedia 理学组合算法释 set cover algorithm集合覆盖算法集合覆盖算法是求解集合覆盖问题的算法。集合覆盖问题（set cover problem，简称SCP）是计算机科学、组合数学以及计算复杂性理论中的重要问题。集合覆盖问题的形式化定义如下：给定一个全集以及集合,其中，覆盖（cover）是指一个集合，其中且包含的所有元素的并集为；集合覆盖的判定（Decision）问题为：给定和以及整数，判断是否存在势（Cardinality）小于或者等于的覆盖；集合覆盖的优化（Optimization）问题为：给定和，求一个势最小的覆盖。
随便看	cultural production cultural production and cultural consumption cultural psychological factor of insurance demand cultural psychological warfare cultural psychology cultural quality education of college student cultural radicalism cultural region Cultural Regions of the World cultural relativity Cultural Relic legal provisions of Constitution of the People's Republic of China Cultural Relic legal provisions of Criminal Law of the People's Republic of China Cultural Relic Rescue Planning of Inundated Area of the Three Gorges Project on the Yangtze River cultural relics and museum digital resource system cultural relics conservation and restoration center cultural relics development plan cultural relics exit and entry identification center cultural relics protection law cultural relics protection technology department Cultural Relics Publishing House cultural relics risk assessment cultural relics sites cultural representation cultural reproduction Cultural Resource Management

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