메뉴 건너뛰기




Volumn 1992-October, Issue , 1992, Pages 620-627

Mick gets some (the odds are on his side) (satisfiability)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN ALGEBRA; CLUSTERING ALGORITHMS;

EID: 85022201500     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SFCS.1992.267789     Document Type: Conference Paper
Times cited : (281)

References (11)
  • 1
    • 0001548856 scopus 로고
    • A linear-time algorithm for testing the truth of certain quantified Boolean formulas
    • B. Aspvall, M.F. Plass, and R.E. Tarjan, "A linear-time algorithm for testing the truth of certain quantified Boolean formulas," Inform. Process. Let., Vol. 8, pp. 121-123, 1979.
    • (1979) Inform. Process. Let , vol.8 , pp. 121-123
    • Aspvall, B.1    Plass, M.F.2    Tarjan, R.E.3
  • 2
    • 0025471827 scopus 로고
    • Probabilistic analysis of a generalization of the unit-clause literal section heuristic for the k-satisfiability problem
    • M.-T. Chao and J. Franco, "Probabilistic analysis of a generalization of the unit-clause literal section heuristic for the k-satisfiability problem," Inform. Set., Vol. 51, pp. 289-314, 1990.
    • (1990) Inform. Set , vol.51 , pp. 289-314
    • Chao, M.-T.1    Franco, J.2
  • 3
    • 0024090265 scopus 로고
    • Many hard examples for resolution
    • V. Chvatal and E. Szemerdi, "Many hard examples for resolution," J. Assoc. Comput. Mach., Vol. 35, pp. 759-768, 1988.
    • (1988) J. Assoc. Comput. Mach , vol.35 , pp. 759-768
    • Chvatal, V.1    Szemerdi, E.2
  • 4
  • 5
    • 0001488083 scopus 로고
    • On the complexity of timetable and multicommodity flow problems
    • S. Even, A. Itai, and A. Shamir, "On the complexity of timetable and multicommodity flow problems," SIAM J. Comput., Vol. 5, pp. 691-703, 1976.
    • (1976) SIAM J. Comput , vol.5 , pp. 691-703
    • Even, S.1    Itai, A.2    Shamir, A.3
  • 6
    • 0019346375 scopus 로고
    • Probabilistic analysis of the Davis-Putnam procedure for solving the satisfiability problem
    • J. Franco and M. Paull, "Probabilistic analysis of the Davis-Putnam procedure for solving the satisfiability problem," Discrete Appl. Math., Vol. 5, pp. 77-87, 1983.
    • (1983) Discrete Appl. Math , vol.5 , pp. 77-87
    • Franco, J.1    Paull, M.2
  • 8
    • 0004357807 scopus 로고
    • Etude statistisque de l'existence de solutions de problemes SAT application aux systemes-experts
    • J.-C. Simon, J. Carlier, O. Dubois, and O. Moulines, "Etude statistisque de l'existence de solutions de problemes SAT, application aux systemes-experts," C.R. Acad. Set. Paris. Sir. I Math., Vol. 302, pp. 283-286, 1986.
    • (1986) C.R. Acad. Set. Paris. Sir. i Math , vol.302 , pp. 283-286
    • Simon, J.-C.1    Carlier, J.2    Dubois, O.3    Moulines, O.4


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