摘要
本文给出的扩张矩阵合并问题是NP困难问题的一种新的证明。由此得到了析取式最小问题是NP困难问题的新的证明。之后给出了两个扩张矩阵合并的完备策略,在此基础上给出了扩张矩阵合并的启发函数策略。
This paper gives a new kind of poof that to compound extension matrix is NP--hard. From this, we get a new poof that the minimum problem of disjunctiving formula is NP--hard. This paper gives two complete tactics of compounding extension matrix, so as heuristic function tactic that compound the extension matrix. At last the paper gives a new algorithm of the learning from examples-the heuristic function learning algorithm based on extension matrix theory.
出处
《小型微型计算机系统》
CSCD
北大核心
1997年第6期46-50,共5页
Journal of Chinese Computer Systems
基金
国家自然科学基金
关键词
NP困难问题
扩张矩阵
示例学习
人工智能
NP--hard, Complete tactics, Heuristic function, Extension matrix, Learning from examples