Abstract: 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/C|²），O（|C||U|）}，and its space complexity is O（|C||U/C|²）.Finally，an example is given to explain the feasibility and availability of this method.