摘要
本文应用图论中求二可分图级大匹配的算法于布尔式的化简。为布尔式的化简提供了一个有效算法。
In this article we present a effective Algorism for finding a minimal disjunctive normal form for a Boole form. It improve the Qiune—McCluskey method and make it algorimization based on the Algorism for Matching im Graph thory.
出处
《成都大学学报(自然科学版)》
1993年第1期37-41,共5页
Journal of Chengdu University(Natural Science Edition)