메뉴 건너뛰기




Volumn , Issue , 2004, Pages 246-251

Hidden structure in unsatisfiable random 3-SAT: An empirical study

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; OPTIMIZATION; SET THEORY; THEOREM PROVING;

EID: 16244382529     PISSN: 10823409     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (13)

References (9)
  • 3
    • 0024090265 scopus 로고
    • Many hard examples for resolution
    • October
    • V. Chvtal and E. Szemerédi. Many hard examples for resolution. Journal of the ACM, 35(4):759-768, October 1988.
    • (1988) Journal of the ACM , vol.35 , Issue.4 , pp. 759-768
    • Chvtal, V.1    Szemerédi, E.2
  • 4
    • 0037163958 scopus 로고    scopus 로고
    • Polynomial-time recognition of minimal unsatisfiable formulas with fixed clause-variable difference
    • H. Fleischner, O. Kullmann, and S. Szeider. Polynomial-time recognition of minimal unsatisfiable formulas with fixed clause-variable difference. Theoretical Computer Science, 289(1):503-516, 2002.
    • (2002) Theoretical Computer Science , vol.289 , Issue.1 , pp. 503-516
    • Fleischner, H.1    Kullmann, O.2    Szeider, S.3
  • 9
    • 4444268398 scopus 로고    scopus 로고
    • Validating SAT solvers using an independent resolution-based checker: Practical implementations and other applications
    • March
    • L. Zhang and S. Malik. Validating SAT solvers using an independent resolution-based checker: Practical implementations and other applications. In Proceedings of the Design and Test in Europe Conference, pages 10880-10885, March 2003.
    • (2003) Proceedings of the Design and Test in Europe Conference , pp. 10880-10885
    • Zhang, L.1    Malik, S.2


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