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.
本文给出了逻辑划分问题解集合的树结构以及有关总针数的若干矩阵不等式，建立了一个分枝限界算法。
Subdividing one large block into smaller subunits that can be handled more conveniently, e. g., partitioning a matrix.
把一个大的数据块(例如一个矩阵)划分为若干较小的子单元块以便于处理的过程。
Subdividing one large block into smaller subunits that can be handled more conveniently, e. g., partitioning a matrix.
把一个大的数据块(例如一个矩阵)划分为若干较小的子单元块以便于处理的过程。
应用推荐