摘要
把NP最优化类问题的谓词公式表示法改变为与一定的数据结构相对应的比较适合实际计算的形式,更方便于以实际计算结合理论研究,以进一步探讨这一类难的问题的可行的解法。
This paper presents the way of using predicate formula to replace the representation for the problems of NP optimization classes with one form that corresponds with some data structures.The new form is not only more suitable for practical computation,but also more convenient to combine theoretical research with practical compatation to approach further feasible methods to solve this kind of NP optimization classes problems.
出处
《桂林电子工业学院学报》
1998年第1期7-10,共4页
Journal of Guilin Institute of Electronic Technology
关键词
NP最优化类
谓词公式
量词
邻接矩阵
数据结构
NP optimization classes,predicate formula,quantifier,adjacency matrix,algorithm