Description: SAT problem, also known as conjunctive normal to meet a conjunctive normal form: A1 ∧ A2 ∧ ... ∧ An clause Ai (1 ≤ i ≤ n) of the form: a1 ∨ a2 ∨ ... ∨ ak ai to the text, is a Boolean variable or non Boolean variables. SAT problem is: Is there a group assignment of all Boolean variable (TRUE or FALSE), and makes the whole conjunctive normal fetch is true.
To Search:
File list (Check if you may need any files):
SAT\SAT\Debug\SAT.exe
...\...\.....\SAT.ilk
...\...\.....\SAT.map
...\...\.....\SAT.obj
...\...\.....\sat.pbi
...\...\.....\sat.pbo
...\...\.....\sat.pbt
...\...\.....\SAT.pch
...\...\.....\SAT.pdb
...\...\.....\sat._xe
...\...\.....\vc60.idb
...\...\.....\vc60.pdb
...\...\SAT.CPP
...\...\SAT.DSP
...\...\SAT.DSW
...\...\SAT.ncb
...\...\SAT.OPT
...\...\SAT.PLG
...\...\算法效率.doc
...\...\Debug
...\SAT
SAT
Download