-
1
-
-
85035284172
-
-
Frontiers in Problem Solving: Phase Transitions and Complexity, edited by T. Hogg, B. A. Huberman, and C. Williams [Art. Intell. 81 (1996)]
-
Frontiers in Problem Solving: Phase Transitions and Complexity, edited by T. Hogg, B. A. Huberman, and C. Williams [Art. Intell. 81 (1996)].
-
-
-
-
4
-
-
0001789169
-
-
AAAI Press/MIT Press, Cambridge, MA
-
D. Mitchell, B. Selman, and H. Levesque, in Proceedings of the 10th National Conference On Artificial Intelligence (AAAI Press/MIT Press, Cambridge, MA, 1992), p. 440.
-
(1992)
Proceedings of the 10th National Conference On Artificial Intelligence
, pp. 440
-
-
Mitchell, D.1
Selman, B.2
Levesque, H.3
-
6
-
-
0033536221
-
-
R. Monasson, R. Zecchina, S. Kirkpatrick, B. Selman, and L. Troyansky, Nature (London) 400, 133 (1999).
-
(1999)
Nature (London)
, vol.400
, pp. 133
-
-
Monasson, R.1
Zecchina, R.2
Kirkpatrick, S.3
Selman, B.4
Troyansky, L.5
-
16
-
-
0004219960
-
-
Academic Press, New York
-
B. Bollobas, Random Graphs (Academic Press, New York, 1985).
-
(1985)
Random Graphs
-
-
Bollobas, B.1
-
18
-
-
85035283498
-
-
Technical Report, Tel Aviv University (1979)
-
C. Caro, Report, Tel Aviv University (1979)
-
-
-
Caro, C.1
Wei, V.K.2
-
30
-
-
0000187166
-
-
E. Caglioti, V. Loreto, H. J. Herrmann, and M. Nicodemi, Phys. Rev. Lett. 79, 1575 (1997).
-
(1997)
Phys. Rev. Lett.
, vol.79
, pp. 1575
-
-
Caglioti, E.1
Loreto, V.2
Herrmann, H.J.3
Nicodemi, M.4
-
35
-
-
85035285732
-
-
K. Mehlhorn and St. Näher, The LEDA Platform of Combinatorial and Geometric Computing (Cambridge University Press, Cambridge, 1999);, also see http://www.mpi-sb.mpg.de/LEDA/leda.html
-
K. Mehlhorn and St. Näher, The LEDA Platform of Combinatorial and Geometric Computing (Cambridge University Press, Cambridge, 1999);also see http://www.mpi-sb.mpg.de/LEDA/leda.html.
-
-
-
-
36
-
-
0003415652
-
-
Addison-Wesley, Reading, MA
-
A. V. Aho, J. E. Hopcroft, and J. D. Ullman, The Design and Analysis of Computer Algorithms (Addison-Wesley, Reading, MA, 1974).
-
(1974)
The Design and Analysis of Computer Algorithms
-
-
Aho, A.V.1
Hopcroft, J.E.2
Ullman, J.D.3
-
40
-
-
0002435041
-
-
IEEE Computer Society Press, Los Alamitos, CA
-
R. Lüling and B. Monien, Sixth International Parallel Processing Symposium (IEEE Computer Society Press, Los Alamitos, CA, 1992), p. 543.
-
(1992)
Sixth International Parallel Processing Symposium
, pp. 543
-
-
Lüling, R.1
Monien, B.2
-
48
-
-
85035256186
-
-
e-print cond-mat/0009418
-
M. Mezard and G. Parisi, e-print cond-mat/0009418.
-
-
-
Mezard, M.1
Parisi, G.2
-
49
-
-
85035261767
-
-
principle, a scaling (Formula presented) can also be plugged in. This would be analogous to infinite-connectivity spin-glass models in the zero-temperature limit, and was also considered in the variational approach 7 to 3 satisfiability. However, its inclusion in the presented formulation leads however to saddle-point equations which could not be solved by the authors
-
In principle, a scaling (Formula presented) can also be plugged in. This would be analogous to infinite-connectivity spin-glass models in the zero-temperature limit, and was also considered in the variational approach 7 to 3 satisfiability. However, its inclusion in the presented formulation leads however to saddle-point equations which could not be solved by the authors.
-
-
-
|