机译:An improved algorithm for the (n,3)documentclass12pt{minimal} usepackage{amsmath} usepackage{wasysym} usepackage{amsfonts} usepackage{amssymb} usepackage{amsbsy} usepackage{mathrsfs} usepackage{upgreek} setlength{oddsidemargin}{-69pt} begin{document}$$(n, 3)$$end{document}-MaxSAT problem: asking branchings to satisfy the clauses
Changsha University of Science and Technology;
Central South University;
CNF formula; 3-SAT; Branching algorithm; Complexity; Parameterized complexity;