SCOPUS 정보 검색 플랫폼

Volumn 6, Issue 4, 2001, Pages 329-344

Random constraint satisfaction: A more accurate picture

(6) Achlioptas, Dimitris a Molloy, Michael S O a Kirousis, Lefteris M b Stamatiou, Yannis C b Kranakis, Evangelos c Krizanc, Danny c

a UNIVERSITY OF TORONTO (Canada)

b UNIVERSITY OF PATRAS (Greece)

c CARLETON UNIVERSITY (Canada)

Author keywords

Constraint satisfaction; Phase transitions; Random graphs; Threshold phenomena

Indexed keywords

ASYMPTOTIC STABILITY; COMPUTER SIMULATION; PROBABILITY; PROBLEM SOLVING; RANDOM PROCESSES; THRESHOLD LOGIC;

RANDOM CONSTRAINT SATISFACTION PROBLEMS (CSP);

CONSTRAINT THEORY;

EID: 0035479320 PISSN: 13837133 EISSN: None Source Type: Journal
DOI: 10.1023/A:1011402324562 Document Type: Article

Times cited : (52)

References (36)

1
- 0033480515
- A sharp threshold for k-colorability
- (1999) Random Structure and Algorithms , vol.14 , pp. 13-70
- Achlioptas, D.¹ Friedgut, E.²

2
- 84948976066
- Random constraint satisfaction: A more accurate picture
- Springer-Verlag
- (1997) Proceedings of the Third International Conference on Principles and Practice of Constraint Programming (CP 97) , pp. 107-120
- Achlioptas, D.¹ Kirousie, L.M.² Kranakiz, E.³ Krizanc, D.⁴ Molloy, M.S.O.⁵ Stamation, Y.C.⁶

3
- 0002403658
- Almost all graphs with 2.522 n edges are not 3-colorable
- (1999) Electronic Journal of Combinatorics , vol.6
- Achlioptas, D.¹ Molloy, M.²

4
- 0003430191
- New York: J. Wiley
- (1992) The Probabilitstic Method
- Alon, N.¹ Spencer, J.H.² Erdos, P.³

5
- 0010779641
- Special volume on frontiers in problem solving: Phase transitions and complexity
- Guest editors: T. Hogg, B. A. Hubermann, & C. P. Williams
- (1996) Artificial Intelligence , vol.81 , pp. 1-2
- Bobrow, D.G.¹ Brady, M.²

6
- 0004219960
- London: Academic Press
- (1996) Random Graphs
- Bollobás, B.¹

7
- 0027149104
- In the satisfiability and maximum satisfiability of random 3-CNF formulas
- (1993) Proceedings of the Fourth Annual ACM-SIAM Symposium on Discrete Algorithms , pp. 322-330
- Broder, A.Z.¹ Frieze, A.M.² Uplas, E.³

8
- 0022809084
- Probabilistic analysis of two heuristics for the 3-satisfiability problem
- (1986) SIAM Journal on Computing , vol.15 , pp. 1106-1118
- Chao, M.-T.¹ Franco, J.²

9
- 0025471827
- Probabilistic analysis of a generalization of the unit-clause literal selection heuristic for the k-satisfiability problem
- (1990) Information Science , vol.51 , pp. 289-314
- Chao, M.-T.¹ Franco, J.²

10
- 0001580511
- Where the really hard problems are
- (1991) Proceedings of IJCAI 91 , pp. 331-337
- Cheeseman, P.¹ Kanfsky, B.² Taylor, W.³

11
- 85022201500
- Mick gets some (the odds are on his side)
- (1992) Proceedings of 33rd IEEE Symposium on Foundations of Computer Science , pp. 620-627
- Chvátal, V.¹ Reed, B.²

12
- 0001853314
- Constraint networks
- S. Shapiro, ed., New York: Wiley
- (1992) Encyclopedia of Artificial Intelligence, 2nd ed. , pp. 276-285
- Dechter, R.¹

13
- 0003642559
- Preprint, LAFORIA, CNRS-Université Paris 6
- (1996) A General Upper Bound for the Satisfiability Threshold of Random r-SAT Formulae
- Dubois, O.¹ Boufkhad, Y.²

14
- 0001847481
- On the evolution of random graphs
- (1960) Publ. of the Math. Inst. of the Hung. Acad. Sci. , vol.3 , pp. 17-61
- Erdos, P.¹ Rény, A.²

15
- 84974085802
- On random 3-SAT
- (1995) Combinatorics, Probability and Computing , vol.4 , pp. 189-195
- El Maftouhi, A.¹ Fernandez de la Vega, W.²

16
- 0033458154
- Sharp thresholds for graph properties and the k-sat problem
- appendix by Jean Bourgain
- (1999) Journal of the American Mathematical Society , vol.12 , pp. 1017-1054
- Friedgut, E.¹

17
- 0030371894
- Analysis of two simple heuristics on a random instance of k-SAT
- (1996) Journal of Algorithm , vol.20 , pp. 312-355
- Frieze, A.¹ Suen, S.²

18
- 0003712236
- Personal communication
- (1999)
- Gent, I.¹

19
- 0030388062
- A threshold for unsatisfiability
- (1996) Journal of Computer and System Science , vol.53 , pp. 469-486
- Goerdt, A.¹

20
- 4243481486
- In [5]
- Refining the phase transition in combinatorial search , pp. 127-154
- Hogg, T.¹

21
- 0024140061
- The influence of variables on Boolean functions
- (1988) Proceedings of the 29th Annual Symposium on the Foundations of Computer Science , pp. 68-80
- Kahn, J.¹ Kalai, G.² Linial, N.³

22
- 0002171821
- Tail bounds for occupancy and the satisfiability threshold conjecture
- (1995) Random Structures and Algorithms , vol.7 , pp. 59-80
- Kamath, A.¹ Motwani, R.² Palem, K.³ Spirakis, P.⁴

23
- 0003642561
- Personal communication
- (1999)
- Xu, K.¹

24
- 0028434242
- Critical behavior in the satisfiability of random Boolean expression
- (1994) Science , vol.264 , pp. 1297-1301
- Kirkpatrick, S.¹ Selman, B.²

25
- 0346703202
- Approximating the unsatisfiability threshold of random formulas
- (1998) Random Structures and Algorithms , vol.12 , pp. 253-269
- Kirousis, L.M.¹ Kranakis, E.² Krizanc, D.³ Stamatiou, Y.C.⁴

26
- 84957371005
- Random constraint satisfaction: Theory meets practice
- (1998) Proceedings of the 4th International Conference on Principles and Practice of Constraint Programming (CP' 98)
- MacIntyre, E.¹ Prosser, P.² Smith, B.³ Walsh, T.⁴

27
- 0000959937
- Constraint satisfaction
- S. Shapiro, New York: Wiley
- (1992) Encyclopedia of Artificial Intelligence. 2nd ed. , pp. 285-293
- Mackworth, A.K.¹

28
- 84971698109
- On a correlation inequality of Farr
- (1992) Combinatorics, Probability and Computing , vol.1 , pp. 157-160
- McDiarmid, C.¹

29
- 0030105333
- Generating hard satisfiability problems
- (1996) Artificial Intelligence , vol.81 , pp. 17-29
- Mitchell, D.¹ Selman, B.² Levesque, H.³

30
- 4243481949
- In [5]
- An empirical study of phase transitions in binary constraint satisfaction problems , pp. 81-109
- Prosser, P.¹

31
- 4243484445
- In [5]
- Locating the phase transition in binary constraint satisfaction problems , pp. 155-181
- Smith, B.M.¹ Dyer, M.E.²

32
- 0003802869
- Philadelphia: SIAM
- (1994) Ten Lectures on the Probabilistic Method, 2nd edition
- Spencer, J.H.¹

33
- 0002680001
- Understanding line drawings of scenes with shadows
- New York: McGraw-Hill
- (1995) The Psychology of Computer Vision , pp. 19-91
- Waltz, D.¹

34
- 0027001333
- Using deep structure to locate hard problems
- (1992) Proceedings of AAAI-98 , pp. 472-477
- Williams, C.¹ Hogg, T.²

35
- 0027704597
- Extending deep structure
- (1993) Proceedings of AAAI-93 , pp. 152-158
- Williams, C.¹ Hogg, T.²

36
- 0028529156
- Exploiting the deep structure of constraint problems
- (1994) Artificial Intelligence , vol.70 , pp. 73-117
- Williams, C.¹ Hogg, T.²

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