最坏情况下#3-SAT问题最小上界.pdfVIP

ISSN 计算机研究与发展 1000—12391CN11—1777／TP of Researchand 48(11)：2055—2063，2011 JournalComputer Development 最坏情况下#3-SAT问题最小上界 周俊萍1矗 殷明浩2’3 周春光1 翟延冬1 王康平1 1(吉林大学计算机科学与技术学院长春130012) 2(东北师范大学计算机科学与信息技术学院长春 130117) 3(教育部符号计算与知识工程重点实验室(吉林大学)长春130012) (zhoujp08@mails．jlu．edu．en) MinimizedBound ProblemintheWorstCase Upper for#3-SAT ZhouJunpin91”，YinMingha02”，ZhouChunguan91，ZhaiYandon91，andWangKangpin91 ’(School Scienceand 130012) ofComputer Technology，JilinUniversity，Changchun 2(School Scienceand Normal 130117) ofCompute InformationTechnology，NortheastUniversity，Changchun and Education， 3(KeyLaboratoryofSymbolicComputationKnowledgeEngineering(JilinUniversity)，Ministryof 130012) Changchun Abstract model isthe of thenumberof or#SAT models Propositionalcounting problemcomputing fora formula．Thetheoreticalof for givenpropositional rigorous analysisalgorithmssolving#SAT havebeen intheliterature．Thetime iscalculatedbasedonthesizeofthe#SAT proposed complexity the alsothenumberof onnot numberofvariables，but instances，dependingonly ontheworstcase bound withthenumberofclausesasthe cannot upper for#SAT parameteronly measurethe ofthe also reflecttheir is efficiencyalgorithms，butcorrectly to intheworst the theminimizedboundof#SAT case number