Description: 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.
To Search:
File list (Check if you may need any files):
SAT\Debug\vc60.idb
...\.....\vc60.pdb
...\.....\SAT.exe
...\.....\SAT.pdb
...\.....\SAT.pch
...\.....\SAT.map
...\.....\sat.pbi
...\.....\sat.pbt
...\.....\sat._xe
...\.....\sat.pbo
...\.....\SAT.ilk
...\.....\SAT.obj
...\SAT.ncb
...\SAT.PLG
...\SAT.DSP
...\SAT.CPP
...\SAT.OPT
...\SAT.DSW
...\算法效率.doc
...\Debug
SAT
Download