基于二进制可分辨矩阵的快速求核算法

Quick computing core algorithm based on binary discernibility matrix

目前，求核算法存在以下不足：求得的核与正区域的核不一致，求核算法的时间复杂度和空间复杂度不理想。针对上述问题，给出一种二进制可分辨矩阵的定义及其求核性质，并证明了由该性质获得的核与正区域的核是等价的，然后设计求核算法，该算法的时间复杂度为max{O（｜C｜｜U／CI^2），O（｜C｜｜UI）}，空间复杂度为O（｜C｜｜U／CI^2）。最后实例说明该方法的可行性和有效性。

At present,the algorithms of the computing core have the following shortcomings： the core acquired from these algorithms is not the core based on positive region,the time complexity and space complexity are not good.Aiming at these problems,a binary discernibility matrix and correspondence property of computing core are provided.It is proved that the core acquired from the property is equivalent to the core based on positive region.Then,the computing core algorithm is designed,its time complexity is max{O（｜C｜｜U/CI^2）,O（｜C｜｜UI）},and its space complexity is O（｜C｜｜U/CI^2）.Finally,an example is given to explain the feasibility and availability of this method.