Aiming at the problem of equivalent conversion from conjunctive normal form to disjunctive normal form, an effective algorithm was proposed to construct reduction tree based on discernibility matrix.
针对差别矩阵求约简过程中合取范式向析取范式等价转换的难题，提出一种基于差别矩阵构造约简树的有效方法。
An new concept of saturated conjunctive normal form is introduced and the nature of sat problem is studied for utilizing the characteristic of saturated conjunctive normal form.
引入了一个饱和合取范式的概念，利用饱和合取范式的性质，对SAT问题的本质进行了研究。
Therefore, the optimization problem can be changed to normal quadratic programming form which can be solved by quadratic programming method.
这种方法还可以解决任意形状报价曲线给交易算法带来的困难。
应用推荐