메뉴 건너뛰기




Volumn , Issue , 2005, Pages 337-342

A simple model to generate hard satisfiable instances

Author keywords

[No Author keywords available]

Indexed keywords

ASYMPTOTIC PHASE; DOMAIN SIZE; FORMAL ANALYSIS; INCOMPLETE SEARCHES; RANDOM INSTANCE; THRESHOLD POINT;

EID: 84880735610     PISSN: 10450823     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (68)

References (19)
  • 3
    • 9444229277 scopus 로고    scopus 로고
    • Hiding satisfying assignments: Two are better than one
    • D. Achlioptas, H. Jia, and C. Moore. Hiding satisfying assignments: two are better than one. In Proc. of AAAI'04, pp. 131-136, 2004.
    • (2004) Proc. of AAAI'04 , pp. 131-136
    • Achlioptas, D.1    Jia, H.2    Moore, C.3
  • 5
    • 0000802475 scopus 로고    scopus 로고
    • Short proofs are narrow - Resolution made simple
    • E. Ben-Sasson and A. Wigderson. Short proofs are narrow - resolution made simple. Journal of the ACM, 48(2):149-169, 2001.
    • (2001) Journal of the ACM , vol.48 , Issue.2 , pp. 149-169
    • Ben-Sasson, E.1    Wigderson, A.2
  • 7
    • 0004356882 scopus 로고    scopus 로고
    • Finding hard instances of the satisfiability problem: A survey
    • S.A. Cook and D.G. Mitchell. Finding hard instances of the satisfiability problem: a survey. DIMACS Ser. Disc. Math. & TCS, 35, 1997.
    • (1997) DIMACS Ser. Disc. Math. & TCS , vol.35
    • Cook, S.A.1    Mitchell, D.G.2
  • 8
    • 35248894361 scopus 로고    scopus 로고
    • The satisfiability threshold for randomly generated binary constraint satisfaction problems
    • A.M. Frieze and M. Molloy. The satisfiability threshold for randomly generated binary constraint satisfaction problems. In Proc. of Random'03, pp. 275-289, 2003.
    • (2003) Proc. of Random'03 , pp. 275-289
    • Frieze, A.M.1    Molloy, M.2
  • 9
    • 35048897061 scopus 로고    scopus 로고
    • Consistency and random constraint satisfaction models with a high constraint tightness
    • Y. Gao and J. Culberson. Consistency and random constraint satisfaction models with a high constraint tightness. In CP'04, pp. 17-31, 2004.
    • (2004) CP'04 , pp. 17-31
    • Gao, Y.1    Culberson, J.2
  • 10
    • 0035479063 scopus 로고    scopus 로고
    • Random constraint satisfaction: Flaws and structure
    • DOI 10.1023/A:1011454308633
    • I.P. Gent, E. MacIntyre, P. Prosser, B.M. Smith, and T. Walsh. Random constraint satisfaction: flaws and structure. Constraints, 6(4):345-372, 2001. (Pubitemid 32820492)
    • (2001) Constraints , vol.6 , Issue.4 , pp. 345-372
    • Gent, I.P.1    Macintyre, E.2    Prosser, P.3    Smith, B.M.4    Walsh, T.5
  • 12
    • 0024866111 scopus 로고
    • Pseudo-random number generation from one-way functions
    • R. Impagliazzo, L. levin, and M. Luby. Pseudo-random number generation from one-way functions. In Proc. of STOC'89, pp. 12-24, 1989.
    • (1989) Proc. of STOC'89 , pp. 12-24
    • Impagliazzo, R.1    Levin, L.2    Luby, M.3
  • 13
    • 84880720715 scopus 로고    scopus 로고
    • From spin glasses to hard satisfiable formulas
    • H. Jia, C. Moore, and B. Selman. From spin glasses to hard satisfiable formulas. In SAT'04, 2004.
    • (2004) SAT'04
    • Jia, H.1    Moore, C.2    Selman, B.3
  • 14
    • 23044534120 scopus 로고    scopus 로고
    • Resolution complexity of random constraints
    • D.G. Mitchell. Resolution complexity of random constraints. In Proc. of CP'02, pp. 295-309, 2002.
    • (2002) Proc. of CP'02 , pp. 295-309
    • Mitchell, D.G.1
  • 15
    • 0141534116 scopus 로고    scopus 로고
    • Models for random constraint satisfaction problems
    • M. Molloy. Models for random constraint satisfaction problems. SIAM Journal of computing, 32(4):935-949, 2003.
    • (2003) SIAM Journal of Computing , vol.32 , Issue.4 , pp. 935-949
    • Molloy, M.1
  • 16
    • 0030105626 scopus 로고    scopus 로고
    • Locating the phase transition in binary constraint satisfaction problems
    • B.M. Smith and M.E. Dyer. Locating the phase transition in binary constraint satisfaction problems. Artificial Intelligence, 81:155-181, 1996. (Pubitemid 126349553)
    • (1996) Artificial Intelligence , vol.81 , Issue.1-2 , pp. 155-181
    • Smith, B.M.1    Dyer, M.E.2
  • 17
    • 0034882302 scopus 로고    scopus 로고
    • Constructing an asymptotic phase transition in random binary constraint satisfaction problems
    • DOI 10.1016/S0304-3975(01)00166-9, PII S0304397501001669
    • B.M. Smith. Constructing an asymptotic phase transition in random binary constraint satisfaction problems. TCS, 265:265-283, 2001. (Pubitemid 32775944)
    • (2001) Theoretical Computer Science , vol.265 , Issue.1-2 , pp. 265-283
    • Smith, B.M.1
  • 18
    • 14344276587 scopus 로고    scopus 로고
    • Exact phase transitions in random constraint satisfaction problems
    • K. Xu and W. Li. Exact phase transitions in random constraint satisfaction problems. Journal of Artificial Intelligence Research, 12:93-103, 2000.
    • (2000) Journal of Artificial Intelligence Research , vol.12 , pp. 93-103
    • Xu, K.1    Li, W.2
  • 19
    • 0345438632 scopus 로고    scopus 로고
    • Many hard examples in exact phase transitions with application to generating hard satisfiable instances
    • cs.CC/0302001
    • K. Xu and W. Li. Many hard examples in exact phase transitions with application to generating hard satisfiable instances. CoRR Report cs.CC/0302001, 2003.
    • (2003) CoRR Report
    • Xu, K.1    Li, W.2


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