基于遗传算法的快速求解算法

Fast SAT Solver is an program, which solves the Boolean satisfiability problem. Complexity of this problem is NP-completeness, non-trivial problems of this complexity can not be solved on current HW in reasonable time while using ordinary algorithms. This program solves problem using genetic algorithm (GA). Thanks to GA, (some) instances of this problem can be solved much faster than problem"s theoretical complexity expects to. Disadvantage of this approach is fact, that there is not guarantee to find solution if any exists. Fast SAT Solver can solve this problem using either GA, or by blind algorithm (brute force).

fss-0.1
src
input98.txt
README
proj_doc.pdf
input-20v-20f-6s.txt
input-29v-21f-12596s.txt