Co-NP是什么意思 Co-NP的读音、翻译、用法

'Co-NP'是计算机科学中的术语，源自英语单词“complementary NP”，意为补集NP。它指的是一类问题的集合，包括了所有在NP问题上的补集问题。简单来说，一个问题属于Co-NP，当且仅当它的补集问题属于NP。

例句：

1. The problem of determining the existence of prime numbers in Co-NP.

判断质数是否存在是Co-NP问题。

2. Co-NP problems include some famous ones like the Boolean satisfiability problem.

Co-NP包括一些著名问题，例如布尔可满足性问题。

3. The question of whether a graph contains a Hamiltonian path is in Co-NP.

问一个图是否包含哈密顿路径属于Co-NP问题。

4. One of the most famous Co-NP complete problems is the graph isomorphism problem.

最著名的Co-NP完备问题之一是图同构问题。

5. The decision version of the subset sum problem is Co-NP complete.

子集和问题的决策版本是Co-NP完备的。

6. The problem of determining whether an undirected graph is bipartite is in Co-NP.

判断无向图是否二分图属于Co-NP问题。

7. The question of whether a given formula is a tautology is Co-NP complete.

判断一个给定的公式是否为重言式属于Co-NP完备问题。

8. The problem of determining whether a given regular language is infinite is in Co-NP.

判断一个给定的正则语言是否无限属于Co-NP问题。

9. The question of whether a given boolean circuit can be evaluated to true is in Co-NP.

判断一个给定的布尔电路能否被计算为真属于Co-NP问题。