【求解SAT问题的拟物拟人算法】金人超.pdf
Quasiphysical and Quasisociological Algorithm for Solving SAT Problems by JinRenChao SupervisedbyProf.HuangWen Qi A Dissertation Submitted to theAcademicDegreesEvaluation Committeeof HuazhongUniversityofScience andTechnology fortheDoctorDegreeofPhilosophyinEngineering October,1998 HuazhongUnivers
华中理工大学博士学位论文 第5章介绍了改进的求解SAT问题的拟物拟人算法Solar2.
华中理工大学博士学位论文 Abstract SATproblem,orCNF(conjunctionnormalform)satisfiabilityproblem,istoask if thereexistsforagivenCNFa truth assignmentsuch that theCNFistrue,namely satisfiesit.SATproblem is thefirstproblem shown tobeNP-complete.It has special significanceinNP-complete theory.