选拔算法是两级逻辑综合中求解最小化覆盖的经典方法之一，但在输出变量集合和质立方体集合规模较大的情况下，采用选拔法求最小化覆盖存在空间复杂度高、求解时间长等问题。

But as the output variables and the prime implicant grow up, both the long processing time and the resource requirement become the major problems to be resolved with the extraction method.

youdao

选拔算法是两级逻辑综合中求解最小化覆盖的经典方法之一，但在输出变量集合和质立方体集合规模较大的情况下，采用选拔法求最小化覆盖存在空间复杂度高、求解时间长等问题。

But as the output variables and the prime implicant grow up, both the long processing time and the resource requirement become the major problems to be resolved with the extraction method.

youdao