提出了以否定树为基础的解决SOP型函数求补运算的新算法。
A new algorithm is given to find complements of functions in SOP form based on Algorithm in this paper.
虽然我们可以定义其他一些集合运算，但求补、并和交运算是我们最感兴趣的三个集合运算。
While other set operations may be defined, the operations of complementation, union, and intersection are of primary interest to us.
虽然我们可以定义其他一些集合运算，但求补、并和交运算是我们最感兴趣的三个集合运算。
While other set operations may be defined, the operations of complementation, union, and intersection are of primary interest to us.
应用推荐