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.

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

• We are an exchange download platform that only provides communication channels. The downloaded content comes from the internet. Except for download issues, please Google on your own.
• The downloaded content is provided for members to upload. If it unintentionally infringes on your copyright, please contact us.
• Please use Winrar for decompression tools
• If download fail, Try it againg or Feedback to us.
• If downloaded content did not match the introduction, Feedback to us，Confirm and will be refund.
• Before downloading, you can inquire through the uploaded person information

Nothing．