Login
|
New Account
AAAAAA
ITA
ENG
Results:
1-6
|
Results: 6
Phase transitions in combinatorial problems
Authors:
Dubois, O Monasson, R Selman, B Zecchina, R
Citation:
O. Dubois et al., Phase transitions in combinatorial problems, THEOR COMP, 265(1-2), 2001, pp. 1-1
Algorithm portfolios
Authors:
Gomes, CP Selman, B
Citation:
Cp. Gomes et B. Selman, Algorithm portfolios, ARTIF INTEL, 126(1-2), 2001, pp. 43-62
Statistical physics and computational complexity
Authors:
Kirkpatrick, S Selman, B
Citation:
S. Kirkpatrick et B. Selman, Statistical physics and computational complexity, PR S PHYS, 2001, pp. 331-345
Compute-intensive methods in artificial intelligence
Authors:
Selman, B
Citation:
B. Selman, Compute-intensive methods in artificial intelligence, ANN MATH A, 28(1-4), 2000, pp. 35-38
2+p-SAT: Relation of typical-case complexity to the nature of the phase transition
Authors:
Monasson, RM Zecchina, R Kirkpatrick, S Selman, B Troyansky, L
Citation:
Rm. Monasson et al., 2+p-SAT: Relation of typical-case complexity to the nature of the phase transition, RAND STR AL, 15(3-4), 1999, pp. 414-435
Determining computational complexity from characteristic 'phase transitions'
Authors:
Monasson, R Zecchina, R Kirkpatrick, S Selman, B Troyansky, L
Citation:
R. Monasson et al., Determining computational complexity from characteristic 'phase transitions', NATURE, 400(6740), 1999, pp. 133-137
Risultati:
1-6
|