Algorithmic adventures at the interface of computer science, statistical physics, and combinatorics

被引：0

作者：

Selman, B ^{[1
]}

机构：

[1] Cornell Univ, Dept Comp Sci, Ithaca, NY 14853 USA

来源：

PRINCIPLES AND PRACTICE OF CONSTRAINT PROGRAMMING - CP 2004, PROCEEDINGS | 2004年 / 3258卷

关键词：

D O I：

暂无

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：9 / 12

页数：4

共 10 条

[1] Rigorous results for random (2+p)-SAT [J].

Achlioptas, D ;

Kirousis, LM ;

Kranakis, E ;

Krizanc, D .

THEORETICAL COMPUTER SCIENCE, 2001, 265 (1-2) :109-129

[2] Computer science: Satisfied with physics [J].

Gomes, CP ;

Selman, B .

SCIENCE, 2002, 297 (5582) :784-785

[3]

GOMES CP, 2000, J AUTOM REAS, V24

[4] Phase transitions and the search problem [J].

Hogg, T ;

Huberman, BA ;

Williams, CP .

ARTIFICIAL INTELLIGENCE, 1996, 81 (1-2) :1-15

[5]

KIRKPATRICK S, 2001, MORE IS DIFFERENT 50

[6] Analytic and algorithmic solution of random satisfiability problems [J].

Mézard, M ;

Parisi, G ;

Zecchina, R .

SCIENCE, 2002, 297 (5582) :812-815

[7] Determining computational complexity from characteristic 'phase transitions' [J].

Monasson, R ;

Zecchina, R ;

Kirkpatrick, S ;

Selman, B ;

Troyansky, L .

NATURE, 1999, 400 (6740) :133-137

[8]

SELMAN B, 1993, DIMACS SERIES DISCR, V26

[9]

WEI W, 2004, P AAAI 04

[10]

WILLIAMS R, 2003, P IJCAI 03

← 1 →