Generating Hard Satisfiability Problems reason生成硬盘可满足性问题的原因.cs.uiuc.pptVIP

Generating Hard Satisfiability Problems Generating Hard Satisfiability Problems Bart Selman, David Mitchell, Hector J. Levesque Presented by Xiaoxin Yin Can SAT be solved in polynomial time in average case? In Goldberg’s paper [Goldberg ‘79] it is claimed that SAT can be solved “on average” in polynomial time. Goldberg’s model of generating formulas m clauses, n variables, each literal has probability p to be in each clause Is SAT really easy? Can SAT be solved in polynomial time in average case? Goldberg’s SAT formulas are easy to solve [Franco Paull ‘83] Theorem 1: Number of truth assignm