A simplified NP-complete MAXSAT problem

被引：53
|
作者：
Raman, V
Ravikumar, B
Rao, SS
机构：
[1] Inst Math Sci, Chennai 600113, India
[2] Univ Rhode Isl, Dept Comp Sci, Kingston, RI 02881 USA
来源：
INFORMATION PROCESSING LETTERS | 1998年 / 65卷 / 01期
关键词：
computational complexity; algorithms;
D O I：
10.1016/S0020-0190(97)00223-8
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
It is shown that the MAX2SAT problem is NP-complete even if every variable appears in at most three clauses. However, if every variable appears in at most two clauses, it is shown that it (and even the general MAXSAT problem) can be solved in linear time. When every variable appears in at most three clauses, we give an exact algorithm for MAXSAT that takes at most 0(3(n/2)n) steps where n is the number of variables. (C) 1998 Published by Elsevier Science B.V.
引用
收藏
页码：1 / 6
页数：6
相关论文
共 50 条
  • [11] THE GRAPH GENUS PROBLEM IS NP-COMPLETE
    THOMASSEN, C
    JOURNAL OF ALGORITHMS, 1989, 10 (04) : 568 - 576
  • [12] The Cophylogeny Reconstruction Problem Is NP-Complete
    Ovadia, Y.
    Fielder, D.
    Conow, C.
    Libeskind-Hadas, R.
    JOURNAL OF COMPUTATIONAL BIOLOGY, 2011, 18 (01) : 59 - 65
  • [13] MULTIPROCESSOR SOLUTION IN OCCAM TO AN NP-COMPLETE PROBLEM
    HEAL, B
    MICROPROCESSORS AND MICROSYSTEMS, 1985, 9 (04) : 162 - 170
  • [14] THE EDGE HAMILTONIAN PATH PROBLEM IS NP-COMPLETE
    BERTOSSI, AA
    INFORMATION PROCESSING LETTERS, 1981, 13 (4-5) : 157 - 159
  • [15] RECTILINEAR STEINER TREE PROBLEM IS NP-COMPLETE
    GAREY, MR
    JOHNSON, DS
    SIAM JOURNAL ON APPLIED MATHEMATICS, 1977, 32 (04) : 826 - 834
  • [16] The maximum edge biclique problem is NP-complete
    Peeters, R
    DISCRETE APPLIED MATHEMATICS, 2003, 131 (03) : 651 - 654
  • [17] Timed protocol insecurity problem is NP-complete
    Benerecetti, Massimo
    Peron, Adriano
    FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE, 2013, 29 (03): : 843 - 862
  • [18] The rectilinear Steiner arborescence problem is NP-complete
    Shi, WP
    Su, C
    SIAM JOURNAL ON COMPUTING, 2006, 35 (03) : 729 - 740
  • [19] Broadcasting with the least energy is an NP-complete problem
    Yang, Wuu
    Tseng, Huei-Ru
    Jan, Rong-Hong
    Shen, Bor-Yeh
    MUE: 2008 INTERNATIONAL CONFERENCE ON MULTIMEDIA AND UBIQUITOUS ENGINEERING, PROCEEDINGS, 2008, : 197 - 200
  • [20] The Rectilinear Steiner Arborescence problem is NP-complete
    Shi, WP
    Su, C
    PROCEEDINGS OF THE ELEVENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2000, : 780 - 787
12345