메뉴 건너뛰기




Volumn 16, Issue , 2003, Pages 47-70

Selecting Complementary Pairs of Literals

Author keywords

Davis Putnam algorithm; differential equations; phase transition; probabilistic analysis; satisfiability

Indexed keywords


EID: 10044222974     PISSN: 15710653     EISSN: 15710653     Source Type: Journal    
DOI: 10.1016/S1571-0653(04)00462-7     Document Type: Article
Times cited : (20)

References (35)
  • 1
    • 0033705075 scopus 로고    scopus 로고
    • Achlioptas D.: Setting two variables at a time yields a new lower bound for random 3-SAT. In: Proc. 32nd Annual ACM Symposium on Theory of Computing (STOC '00) 28-37
  • 2
    • 0034892310 scopus 로고    scopus 로고
    • Lower bounds for random 3-SAT via differential equations
    • Achlioptas D. Lower bounds for random 3-SAT via differential equations. Theoretical Computer Science 265 1-2 (2001) 159-185
    • (2001) Theoretical Computer Science , vol.265 , Issue.1-2 , pp. 159-185
    • Achlioptas, D.1
  • 3
    • 34247139342 scopus 로고    scopus 로고
    • Achlioptas D., Moore C.: The asymptotic order of the random k-SAT threshold. In: Proc. 43rd Annual Symposium on Foundations of Computer Science (FOCS '02)
  • 4
    • 0034499891 scopus 로고    scopus 로고
    • Achlioptas D., Sorkin G. B.: Optimal myopic algorithms for random 3-SAT. In: Proc. 41st Annual Symposium on Foundations of Computer Science (FOCS '00) 590-600
  • 5
    • 0027149104 scopus 로고    scopus 로고
    • Broder A., Frieze A., Upfal E.: On the satisfiability and maximum satisfiability of random 3-CNF formulas. In: Proc. 4th ACM-SIAM Symposium on Discrete Algorithms (SODA '93) 322-330
  • 6
    • 0022809084 scopus 로고
    • Probabilistic analysis of two heuristics for the 3-satisfiability problem
    • Chao M.T., and Franco J. Probabilistic analysis of two heuristics for the 3-satisfiability problem. SIAM J. of Comp 15 4 (1986) 1106-1118
    • (1986) SIAM J. of Comp , vol.15 , Issue.4 , pp. 1106-1118
    • Chao, M.T.1    Franco, J.2
  • 7
    • 0025471827 scopus 로고
    • Probabilistic analysis of a generalization of the unitclause literal selection heuristics for the k-satisfiability problem
    • Chao M.T., and Franco J. Probabilistic analysis of a generalization of the unitclause literal selection heuristics for the k-satisfiability problem. Inform. Sci 51 3 (1990) 289-314
    • (1990) Inform. Sci , vol.51 , Issue.3 , pp. 289-314
    • Chao, M.T.1    Franco, J.2
  • 8
    • 85022201500 scopus 로고    scopus 로고
    • Chvátal V., Reed B.: Mick gets some (the odds are on his side). In: Proc. 33rd Annual Symposium on the Foundation of Computer Science (FOCS '92) 620-627
  • 9
    • 84968765246 scopus 로고    scopus 로고
    • Cooper C., Frieze A., Sorkin, G. B.: A note on random 2-SAT with prescribed literal degrees. In: Proc. 13th ACM-SIAM Symposium on Discrete Algorithms (SODA '02) 316-320
  • 10
    • 0242337623 scopus 로고    scopus 로고
    • Branching processes and their applications in the analysis of tree structures and tree algorithms
    • Habib M., McDiarmid C., Alfonsin R., and Reed B. (Eds), Vol. Springer-Verlag, Berlin
    • Devroye L. Branching processes and their applications in the analysis of tree structures and tree algorithms. In: Habib M., McDiarmid C., Alfonsin R., and Reed B. (Eds). Probabilistic Methods for Algorithmic Discrete Mathematics, Lecture Notes in Computer Science (1998), Vol. Springer-Verlag, Berlin 249-314
    • (1998) Probabilistic Methods for Algorithmic Discrete Mathematics, Lecture Notes in Computer Science , pp. 249-314
    • Devroye, L.1
  • 11
    • 0001691345 scopus 로고    scopus 로고
    • A general upper bound for the satisfiability threshold of random r-SAT
    • Dubois O., and Boufkhad Y. A general upper bound for the satisfiability threshold of random r-SAT. J. of Algorithms 24 (1997) 395-420
    • (1997) J. of Algorithms , vol.24 , pp. 395-420
    • Dubois, O.1    Boufkhad, Y.2
  • 12
    • 0033873490 scopus 로고    scopus 로고
    • Dubois O., Boufkhad Y., Mandler J.: Typical random 3-SAT formulae and the satisfiability threshold. In: Proc. 11th Symposium on Discrete Algorithms (SODA '00) 126-127
  • 13
    • 84880858736 scopus 로고    scopus 로고
    • Dubois O., Dequen G.: A backbone Search Heuristic for Efficient Solving of Hard 3-SAT Formulae. In Proc.: 17th International Joint Conference on Artificial Intelligence (IJCAI '01) 248-253
  • 14
    • 34247148605 scopus 로고    scopus 로고
    • Dubois O., Dequen G.: Renormalization as a function of clause lengths for solving k-SAT. In: Proc. 5th International Symposium on the Theory and Applications of Satisfiability Testing (SAT 02) 130-132
  • 15
    • 34247176780 scopus 로고    scopus 로고
    • Fernadez, W. de la Vega.: On random 2-SAT. Manuscript, 1992.
  • 16
    • 0033458154 scopus 로고    scopus 로고
    • E. Friedgut, (Appendix by Bourgain, J.): Sharp thresholds of graph properties, and the k-SAT problem. J. AMS 12 (1997) 1017-1054
  • 17
    • 0030371894 scopus 로고    scopus 로고
    • Analysis of two simple heuristics for random instances of k-SAT
    • Frieze A., and Suen S. Analysis of two simple heuristics for random instances of k-SAT. J. Algorithms 20 (1996) 312-355
    • (1996) J. Algorithms , vol.20 , pp. 312-355
    • Frieze, A.1    Suen, S.2
  • 18
    • 34247149447 scopus 로고    scopus 로고
    • Frieze A., Wormald N.: k-SAT: a tight threshold for moderately growing k. In: Proc. 5th International Symposium on the Theory and Applications of Satisfiability Testing (SAT 02) 1-6
  • 19
    • 34247150379 scopus 로고    scopus 로고
    • Giannella C.: On Extending Two Threshold Algorithms to Non-Threshold Algorithms by Attaching the Unit Clause Rule, Master Thesis, University of Indiana, (1999). Available at: http://www.cs.indiana.edu/~cgiannel/work.html
  • 20
    • 0030388062 scopus 로고    scopus 로고
    • A threshold for unsatisfiability
    • Goerdt A. A threshold for unsatisfiability. J. Comput. System Sci 53 3 (1996) 469-486
    • (1996) J. Comput. System Sci , vol.53 , Issue.3 , pp. 469-486
    • Goerdt, A.1
  • 21
    • 34247154476 scopus 로고    scopus 로고
    • M. T. Hajiaghayi and G. Sorkin, personal communication, 2002.
  • 23
    • 0016349356 scopus 로고
    • Approximation algorithms for combinatorial problems
    • Johnson D.S. Approximation algorithms for combinatorial problems. Journal of Computer and System Sciences 9 (1974) 256-278
    • (1974) Journal of Computer and System Sciences , vol.9 , pp. 256-278
    • Johnson, D.S.1
  • 25
    • 84938084560 scopus 로고    scopus 로고
    • Kaporis, A. C., Kirousis, L. M., Lalas, E. G.: The probabilistic analysis of a greedy satisfiability algorithm. In: Proc. 10th Annual European Symposium on Algorithms (ESA 2002) Track A. 574-585 Available at: http://students.ceid.upatras.gr/~kaporis/
  • 26
    • 34247135510 scopus 로고    scopus 로고
    • Kaporis, A. C., Kirousis, L. M., Stamatiou, Y. C.: How to prove conditional randomness using the Principle of Deferred Decisions. TR, CTI, Greece, (2002) Available at: www.ceid.upatras.gr/faculty/kirousis/kks-pdd02.ps. Also, available at: http://students.ceid.upatras.gr/~kaporis/
  • 27
    • 34247099830 scopus 로고    scopus 로고
    • Kaporis, A. C., Kirousis, L. M., Stamatiou, Y. C., Vamvakari M., Zito M.: The Unsatisfiability Threshold Revisited. To appear in Discrete Mathematics. Available at: http://students.ceid.upatras.gr/~kaporis/
  • 30
    • 0037008520 scopus 로고    scopus 로고
    • Analytic and Algorithmic Solution of Random Satisfiability Problems
    • Mézard, Parisi G., and Zecchina R.M. Analytic and Algorithmic Solution of Random Satisfiability Problems. Science 297 812 (2002)
    • (2002) Science , vol.297 , Issue.812
    • Mézard1    Parisi, G.2    Zecchina, R.M.3
  • 31
    • 37649031218 scopus 로고    scopus 로고
    • Mézard M., Zecchina R.: The random k-Satisfiability problem: from an analytic solution to an efficient algorithm. Phys. Rev. E in press (2002)
  • 32
    • 0027002161 scopus 로고    scopus 로고
    • Mitchel D., Selman B., Levesque H.: Hard and easy distribution of SAT problems. In: Proc. 10th National Conference of Artifical Intelligence (AAAI 1992) 459-465
  • 33
    • 34247147252 scopus 로고    scopus 로고
    • Mitzemacher M.: Tight thresholds for the pure literal rule. TR, Digital Equipment Corporation, (1997) Available at: www.research.compaq.com/SRC/
  • 35
    • 21344437483 scopus 로고
    • Differential equations for random processes and random graphs
    • Wormald N.C. Differential equations for random processes and random graphs. The Annals of Applied Probability 5 4 (1995) 1217-1235
    • (1995) The Annals of Applied Probability , vol.5 , Issue.4 , pp. 1217-1235
    • Wormald, N.C.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.