SAT问题也称为合取范式的可满足问题,一个合取范式形如:A1∧A2∧…∧An,子句Ai(1≤i≤n)形如:a1∨a2∨…∨ak,其中,ai称为文字,为某一布尔变量或该布尔变量的非。SAT问题是指:是否存在一组对所有布尔变量的赋值(TRUE或FALSE),使得整个合取范式取值为真。
SAT problems are also called conjunctive normal form of the satisfiability problem, a conjunctive normal form such as: A1 lambda A2 lambda ... A An, clause Ai (1 i n ) shaped like: A1 V A2 v ... On AK, wherein, AI is known as the text, a boolean variable or the boolean variable non. SAT problem refers to: the existence of a group of all boolean variable assignment ( TRUE or FALSE ), making the entire conjunctive normal form a value of true.
(2011-12-25, C++ Builder, 564KB, 下载12次)
这是美国数学建模大赛97年的a题一种解决方法是利用计算机仿真的方法
This is the American Mathematical Modeling Contest in a 97 that a solution is to use computer simulation methods (2007-05-10, C++ Builder, 4KB, 下载6次)