SCOPUS 정보 검색 플랫폼

Theoretical Computer Science

Volumn 265, Issue 1-2, 2001, Pages 147-157

Results related to threshold phenomena research in satisfiability: Lower bounds

(1) Franco, John a

a UNIVERSITY OF CINCINNATI (United States)

Author keywords

Phase transition; Satisfiability

Indexed keywords

ALGORITHMS; ARTIFICIAL INTELLIGENCE; BOOLEAN ALGEBRA; CONSTRAINT THEORY; GRAPH THEORY; NORMAL DISTRIBUTION; PHASE TRANSITIONS; POLYNOMIAL APPROXIMATION; PROBLEM SOLVING; STATISTICAL METHODS; THRESHOLD ELEMENTS;

RANDOM CONJUNCTIVE NORMAL FORM (CNF) FORMULAS;

COMPUTER SCIENCE;

EID: 0034882875 PISSN: 03043975 EISSN: None Source Type: Journal
DOI: 10.1016/S0304-3975(01)00158-X Document Type: Article

Times cited : (38)

References (29)

1
- 0034892310
- Lower bounds for random 3-SAT via differential equations
- this Vol.
- (2001) Theoret. Comput. Sci. , vol.265 , pp. 159-185
- Achlioptas, D.¹

2
- 0033705075
- Setting 2 variables at a time yields a new lower bound for random 3-sat
- Association of Computing Machinery, New York
- (2000) 32nd ACM Symp. on Theory of Computing
- Achlioptas, D.¹

3
- 84948976066
- Random constraint satisfaction: A more accurate picture
- Linz, Austria, 1997, Lecture Notes in Computer Science, Springer, Berlin
- (1997) 3rd Conf. on the Principles and Practice of Constraint Programming , vol.1330 , pp. 107-120
- Achlioptas, D.¹ Kirousis, L.M.² Kranakis, E.³ Krizanc, D.⁴ Molloy, M.⁵ Stamatiou, Y.⁶

4
- 0031331860
- The analysis of a list-coloring algorithm on a random graph
- Miami, FL, 1997, IEEE Computer Soc. Press, Los Alamitos, CA
- (1997) 38th Annu. Symp. on Foundations of Computer Science , pp. 204-212
- Achlioptas, D.¹ Molloy, M.²

5
- 0034499891
- Optimal policies for greedy 3-sat algorithms
- IEEE Computer Soc. Press, Los Alamitos, CA
- (2000) 41st Annu. Symp. on Foundations of Computer Science , pp. 590-600
- Achlioptas, D.¹ Sorkin, G.²

6
- 0003830315
- manuscript
- (1999) The scaling window of the 2-SAT transition
- Bollobás, B.¹ Borgs, C.² Chayes, J.³ Kim, J.H.⁴ Wilson, D.B.⁵

7
- 0027149104
- On the satisfiability and maximum satisfiability of random 3-CNF formulas
- Austin, TX, 1993, ACM, New York
- (1993) 4th Annu. ACM-SIAM Symp. on Discrete Algorithms , pp. 322-330
- Broder, A.Z.¹ Frieze, A.M.² Upfal, E.³

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

9
- 0025471827
- Probabilistic analysis of a generalization of the unit-clause literal selection heuristics for the k-satisfiability problem
- (1990) Inform. Sci. , vol.51 , Issue.3 , pp. 1106-1118
- Chao, M.-T.¹ Franco, J.²

10
- 85022201500
- Mick gets some (the odds are on his side)
- Pittsburgh, PA, 1992, IEEE Comput. Soc. Press, Los Alamitos, CA
- (1992) 33th Annu. Symp. on Foundations of Computer Science , pp. 620-627
- Chvátal, V.¹ Reed, B.²

11
- 85059770931
- The complexity of theorem-proving procedures
- Shaker Heights, OH, 1971, ACM, New York
- (1971) 3rd Annu. ACM Symp. on Theory of Computing , pp. 151-158
- Cook, S.A.¹

12
- 84919401135
- A machine program for theorem-proving
- (1962) Comm. ACM , vol.5 , pp. 394-397
- Davis, M.¹ Logemann, G.² Loveland, D.³

13
- 84881072062
- A computing procedure for quantification theory
- (1960) J. Assoc. Comput. Mach. , vol.7 , pp. 201-215
- Davis, M.¹ Putnam, H.²

14
- 0004201732
- manuscript
- (1992) On random 2-sat
- De la Vega, W.F.¹

15
- 0022769172
- On the probabilistic performance of algorithms for the satisfiability problem
- (1986) Inform. Process. Lett. , vol.23 , pp. 103-106
- Franco, J.¹

16
- 0026371511
- Elimination of infrequent variables improves average case performance of satisfiability algorithms
- (1991) SIAM J. Comput. , vol.20 , pp. 1119-1127
- Franco, J.¹

17
- 0024142556
- Probabilistic performance of heuristic for the satisfiability problem
- (1988) Discrete. Appl. Math. , vol.22 , pp. 35-51
- Franco, J.¹ Ho, Y.C.²

18
- 0019346375
- Probabilistic analysis of the Davis-Putnam procedure for solving the satisfiability problem
- (1983) Discrete Appl. Math. , vol.5 , pp. 77-87
- Franco, J.¹ Paull, M.²

19
- 0033458154
- Necessary and sufficient conditions for sharp thresholds of graph properties, and the k-SAT problem
- (1999) J. Amer. Math. Soc. , vol.12 , pp. 1017-1054
- Friedgut, E.¹

20
- 0030371894
- Analysis of two simple heuristics on a random instance of k-SAT
- (1996) J. Algorithms , vol.20 , Issue.2 , pp. 312-355
- Frieze, A.M.¹ Suen, S.²

21
- 0030388062
- A threshold for unsatisfiability
- (1996) J. Comput. System Sci. , vol.53 , Issue.3 , pp. 469-486
- Goerdt, A.¹

22
- 0002610785
- On the complexity of the satisfiability problem
- Austin, TX
- (1979) 4th Workshop on Automated Deductin , pp. 1-6
- Goldberg, A.¹

23
- 0020476233
- Average time analysis of simplified Davis-Putnam procedures
- (1982) Inform. Process. Lett. , vol.15 , Issue.2 , pp. 72-75
- Goldberg, A.¹ Purdom, P.W.² Cynthia, B.³

24
- 0030105044
- Frontiers in problem solving: Phase transitions and complexity: An introduction (special issue)
- (1996) Artif. Intell. , vol.81 , pp. 1-15
- Hogg, T.¹ Huberman, B.A.² Williams, C.P.³

25
- 0004359163
- ICTP, Trieste, Italy
- (1999) Topical Conference on NP-completeness and Phase Transitions
- Pittel, B.¹

26
- 0004215844
- Correction to probabilistic analysis of the Davis-Putnam Procedure for solving the satisfiability problem
- (1987) Discrete Appl. Math. , vol.17 , pp. 295-299
- Plotkin, J.M.¹ Rosenthal, J.W.² Franco, J.³

27
- 0004267179
- Probe order backtracking
- (1997) SIAM J. Comput. , vol.26 , Issue.2 , pp. 456-483
- Purdom, P.W.¹ Haven, G.N.²

28
- 84918983692
- A machine-oriented logic based on the resolution principle
- (1965) J. Assoc. Comput. Mach. , vol.12 , pp. 23-41
- Robinson, J.A.¹

29
- 0030105333
- Generating hard satisfiability problems
- (1996) Artif. Intell. , vol.81 , Issue.1-2 , pp. 17-29
- Selman, B.¹ Mitchell, D.G.² Levesque, H.J.³

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