메뉴 건너뛰기




Volumn 329, Issue 1-3, 2004, Pages 303-313

An improved deterministic local search algorithm for 3-SAT

Author keywords

3 SAT; Exact algorithm; Local search

Indexed keywords

BOOLEAN ALGEBRA; COMPUTER SCIENCE; PROBABILITY; PROBLEM SOLVING; THEOREM PROVING;

EID: 10044219900     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2004.08.002     Document Type: Article
Times cited : (66)

References (4)
  • 2
    • 84937417239 scopus 로고    scopus 로고
    • A Probabilistic 3-SAT algorithm further improved
    • H. Alt, A. Ferreira (Eds.), STACS 2002, Springer, Berlin, Heidelberg
    • T. Hofmeister, U. Schöning, R. Schuler, O. Watanabe, A Probabilistic 3-SAT Algorithm Further Improved, in: H. Alt, A. Ferreira (Eds.), STACS 2002, Lecture Notes in Computer Science, Vol. 2285, Springer, Berlin, Heidelberg, 2002, pp. 192-202.
    • (2002) Lecture Notes in Computer Science , vol.2285 , pp. 192-202
    • Hofmeister, T.1    Schöning, U.2    Schuler, R.3    Watanabe, O.4
  • 4
    • 0141991971 scopus 로고    scopus 로고
    • A probabilistic algorithm for k-SAT based on limited local search and restart
    • U. Schöning, A probabilistic algorithm for k-SAT based on limited local search and restart, Algorithmica 32 (2002) 615-623.
    • (2002) Algorithmica , vol.32 , pp. 615-623
    • Schöning, U.1


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