摘要
该文对有限集上相容关系以及对应完全覆盖的基数进行了分析估计,得到了相应的几个估计公式,并对相容关系所对应的完全覆盖及其所含元素个数的求解设计了相应的程序。
The present paper analyzes and estimates the cardinality of the compatible relation and the related complete cover in a finite set,obtains several estimate formula accordingly,and designs a program to find the complete cover and its element number related to a compatible relation.
出处
《计算机工程与应用》
CSCD
北大核心
2005年第14期105-107,148,共4页
Computer Engineering and Applications
关键词
离散数学
相容关系
完全覆盖
程序设计
discrete mathematics,compatible relation,complete cover,programming
