메뉴 건너뛰기




Volumn 67, Issue 6 2, 2003, Pages

Solving satisfiability problems by fluctuations: The dynamics of stochastic local search algorithms

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; CALCULATIONS; CONFORMAL MAPPING; GRAPH THEORY; LINEAR EQUATIONS; MATHEMATICAL MODELS; MONTE CARLO METHODS; OPTIMIZATION; POLYNOMIALS; PROBLEM SOLVING; STATISTICAL MECHANICS;

EID: 42749105046     PISSN: 1063651X     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article
Times cited : (39)

References (36)
  • 23
    • 0011620023 scopus 로고    scopus 로고
    • Cliques, coloring and satisfiability
    • edited by D.S. Johnson and M.A. Trick; (AMS, Providence)
    • B. Selman, H. Kautz, and B. Cohen, in Cliques, Coloring and Satisfiability, edited by D.S. Johnson and M.A. Trick, DIMACS Series Vol. 26 (AMS, Providence, 1996).
    • (1996) DIMACS Series , vol.26
    • Selman, B.1    Kautz, H.2    Cohen, B.3
  • 31
    • 33645083599 scopus 로고    scopus 로고
    • See the SATLIB athttp://www.satlib.org/
  • 36
    • 33645048593 scopus 로고    scopus 로고
    • note
    • As we will see later on, the case q < 1 is not well described by the independent-neighbor approximation. This is also true for the stronger Poissonian approximation.


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