This paper presents the tree structure of the solution set for logic partitioning problem and some matrix inequalities relating to the total amount of pins.
本文给出了逻辑划分问题解集合的树结构以及有关总针数的若干矩阵不等式，建立了一个分枝限界算法。
This paper presents the tree structure of the solution set for logic partitioning problem and some matrix inequalities relating to the total amount of pins.
本文给出了逻辑划分问题解集合的树结构以及有关总针数的若干矩阵不等式，建立了一个分枝限界算法。
应用推荐