完全问题及其不可近似性外文翻译0503.doc

北方民族大学 外文文献翻译 译文题目 规则NP-完全问题及其不可近似性 原稿题目 A Reduction NP-complete Problems and Its Inapproximability 原稿出处 the National Natural Science Foundation of China 系(部)名 称: 计算机科学与工程学院 学 生 姓 名: XXXX 专 业: 信息管理与信息系统 学 号: 指导教师姓名: 王晓峰 北方民族大学教务处制 外文文献： A Reduction NP-complete Problems and Its Inapproximability Abstract：A CNF formula can be transformed into another formula with some special structures or properties by a proper reduction transformation, such that two formulas have the same satisfiability. The factor graphs of CNF formulas with regular structures have some well properties and known results in theory of graph, which may be applied to investigating satisfiability and its complexity of formulas. The minimal unsatisfiable formulas have a critical characterization, which the formula itself is unsatisfiable and the resulting formula moving anyone clause from the original formula is satisfiable. We present a polynomial reduction from a 3-CNF formula to a (3,4)-CNF formula with regular structure, which each clause contains exactly three literals, and each variable appear exactly four times. Therefore, (3,4)-SAT is a regular NP-complete problem. We focus on investigating satisfiability and properties of (3,4)-CNF formulas, such as inapproximability of MAX (3,4)-SAT. Keywords: reduction, minimal unsatisfiability formula, (3,4)-CNF formula, regular structure, NP-completeness. 1 Introduction Letbe the class of propositional formulas in conjunctive normal form. Aformulais a conjunction of clauses,. The setis the set of variables occurring in the formula. Denote as the number of clauses of F andas the number of variables occurring in. The deficiency of a formula F is defined as, denoted by.is the class offormulas with variables andclauses. A formulais minimal unsatisfiable () ifis unsatisfiable andis satisfiable for any claus