A tighter upper bound for random MAX 2-SAT

Information Processing Letters

Volumn 111, Issue 3, 2011, Pages 115-119

  Xu, Xuelin ^a   Gao, Zongsheng ^a   Xu, Ke ^a  

^a BEIHANG UNIVERSITY   (China)

Author keywords

Computational complexity; First moment argument; MAX 2 SAT; Upper bound

Indexed keywords

CONJUNCTIVE NORMAL FORMS; FIRST-MOMENT ARGUMENT; HIGHER ORDER; MAX 2-SAT; MOMENT METHODS; UPPER BOUND;

BOOLEAN FUNCTIONS;

COMPUTATIONAL COMPLEXITY;

EID: 78449246428     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2010.11.002     Document Type: Article

References (13)

1. D. Coppersmith, D. Gamarnik, M.T. Hajiaghayi, and G.B. Sorkin Random MAX SAT random MAX CUT, and their phase transitions Random Structures Algorithms 24 2004 502 545
2. M.R. Garey, D.S. Johnson, and L. Stockmeyer Some simplified NP-complete graph problems Theoret. Comput. Sci. 1 3 1976 237 267
3. J. Håstad Some optimal inapproximability results J. ACM 48 4 2001 798 859
4. B. Aspvall, M.F. Plass, and R.E. Tarjan A linear-time algorithm for testing the truth of certain quantified Boolean formulas Inform. Process. Lett. 8 3 1979 121 123
5. N. Bansal, and V. Raman Upper bounds for MaxSat: Further improved Aggarwal Rangam Proceedings of 10th Annual Conference on Algorithms and Computation ISSAC'99 Lecture Notes in Comput. Sci. vol. 1741 1999 Springer-Verlag 247 258
6. B. Bollobas, C. Borgs, J.T. Chayes, J.H. Kim, and D.B. Wilson The scaling window of the 2-SAT transition Random Structures Algorithms 18 3 2001 201 256
7. J. Gramm, E.A. Hirsch, R. Niedermeier, and P. Rossmanith Worst-case upper bounds for MAX-2-SAT with an application to MAX-CUT Discrete Appl. Math. 130 2003 139 155
8. E.A. Hirsch A new algorithm for MAX-2-SAT Proceedings of 17th International Symposium on Theoretical Aspects of Computer Science STACS 2000 Lecture Notes in Comput. Sci. vol. 1770 2000 Springer-Verlag 65 73
9. E.A. Hirsch New worst-case upper bounds for SAT J. Automat. Reason. 24 4 2000 397 420
10. R. Niedermeier, and P. Rossmanith New upper bounds for maximum satisfiability J. Algorithms 36 2000 63 88
11. H. Shen, H. Zhang, An empirical study of MAX-2-SAT phase transitions, in: Proc. of LICS'03 Workshop on Typical Case Complexity and Phase Transitions, Ottawa, CA, June 2003.
12. D. Achlioptas, and Y. Peres The threshold for random k-SAT is 2 k log 2 - O (k ) J. Am. Math. Soc. 17 4 2004 947 973
13. K. Xu, and W. Li Exact phase transitions in random constraint satisfaction problems J. Artificial Intelligence Res. 12 2000 93 103