寻找最小代价覆盖是逻辑最小化中的一个重要步骤。

Finding coverage with minimum cost is an important step in logic minimization.

youdao

研究在双向网络中的最小充分集问题，并把他转化为最小顶点覆盖问题。

In this paper, the minimum sufficient set problem in bi-directed networks is studied.

youdao

研究在双向网络中的最小充分集问题，并把他转化为最小顶点覆盖问题。

In this paper, the minimum sufficient set problem in bi-directed networks is studied.

youdao