SCOPUS 정보 검색 플랫폼 - 논문 보기

메뉴 건너뛰기

SIAM Journal on Computing

Volumn 31, Issue 4, 2002, Pages 1048-1075

The efficiency of resolution and Davis-Putnam procedures

(4) Beame, Paul a Karp, Richard a Pitassi, Toniann a Saks, Michael a

a UNIVERSITY OF WASHINGTON (United States)

Author keywords

Davis putnam procedure; Lower bounds; Proof complexity; Random formulas; Resolution; Satisfiability; Search algorithms

Indexed keywords

ALGORITHMS; BOOLEAN ALGEBRA; BOUNDARY CONDITIONS; CONSTRAINT THEORY; PROBABILITY; THEOREM PROVING;

LOWER BOUNDS; RANDOM FORMULAS; RESOLUTION-BASED METHODS; SEARCH ALGORITHMS;

COMPUTATIONAL COMPLEXITY;

EID: 0036520245 PISSN: 00975397 EISSN: None Source Type: Journal
DOI: 10.1137/S0097539700369156 Document Type: Article

Times cited : (84)

References (35)

1
- 0034499891
- Optimal myopic algorithms for random 3-SAT
- IEEE Computer Society Press, Los Alamitos, CA
- (2000) Proceedings of the 41st Annual Symposium on Foundations of Computer Science, Redondo Beach, CA, 2000 , pp. 590-600
- Achlioptas, D.¹ Sorkin, G.²

2
- 0003430191
- John Wiley and Sons, New York
- (1992) The Probabilistic Method
- Alon, N.¹ Spencer, J.² Erdös, P.³

3
- 0018454769
- Fast probabilistic algorithms for Hamiltonian circuits and matchings
- (1979) J. Comput. System Sci. , vol.18 , pp. 155-193
- Angluin, D.¹ Valiant, L.²

4
- 0027149104
- On the satisfiability and maximum satisfiability of random 3-CNF formulas
- Proceedings of the Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, Austin, TX, 1993, ACM, New York , pp. 322-330
- Broder, A.¹ Frieze, A.² Upfal, E.³

5
- 0031639853
- On the complexity of unsatisfiability of random k-CNF formulas
- Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing, Dallas, TX, 1998, ACM, New York, 1999 , pp. 561-571
- Beame, P.¹ Karp, R.² Pitassi, T.³ Saks, M.⁴

6
- 0030396103
- Simplified and improved resolution lower bounds
- IEEE Computer Society Press, Los Alamitos, CA
- (1996) Proceedings of the 37th Annual Symposium on Foundations of Computer Science, Burlington, VT, 1996 , pp. 274-282
- Beame, P.W.¹ Pitassi, T.²

7
- 84957616496
- Resolution and the weak pigeonhole principle
- Springer-Verlag, Berlin
- (1998) Computer Science Logic, Lecture Notes in Comput. Sci. , vol.1414 , pp. 149-156
- Buss, S.¹ Pitassi, T.²

8
- 0031481402
- Lower bounds for cutting planes proofs with small coefficients
- (1997) J. Symbolic Logic , vol.62 , pp. 708-728
- Bonet, M.¹ Pitassi, T.² Raz, R.³

9
- 0034872564
- Space complexity of random formulae in resolution
- Proceedings of the Sixteenth Annual IEEE Conference on Computational Complexity, Chicago, IL, 2001
- Ben-Sasson, E.¹ Galesi, N.²

10
- 0032631763
- Short proofs are narrow - Resolution made simple
- Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, Atlanta, GA, 1999, ACM, New York, 1999 , pp. 517-526
- Ben-Sasson, E.¹ Wigderson, A.²

11
- 0024140287
- Resolution proofs of generalized pigeonhole principles
- (1988) Theoret. Comput. Sci. , vol.62 , pp. 311-317
- Buss, S.¹ Turán, G.²

12
- 0030108241
- Experimental results on the crossover point in random 3SAT
- (1996) Artificial Intelligence , vol.81 , pp. 31-57
- Crawford, J.M.¹ Auton, L.D.²

13
- 0029720065
- Using the Gröbner basis algorithm to find proofs of unsatisfiability
- Proceedings of the Twenty-Eighth Annual ACM Symposium on Theory of Computing, Philadelphia, PA, 1996, ACM, New York, 1996 , pp. 174-183
- Clegg, M.¹ Edmonds, J.² Impagliazzo, R.³

14
- 0025471827
- Probabilistic analysis of a generalization of the unit-clause literal selection heuristics
- (1990) Inform. Sci. , vol.51 , pp. 289-314
- Chao, M.T.¹ Franco, J.²

15
- 0001601465
- The relative efficiency of propositional proof systems
- (1977) J. Symbolic Logic , vol.44 , pp. 36-50
- Cook, S.A.¹ Reckhow, R.A.²

16
- 85022201500
- Mick gets some (the odds are on his side)
- IEEE Computer Society Press, Los Alamitos, CA
- (1992) Proceedings of the 33rd Annual Symposium on Foundations of Computer Science, Pittsburgh, PA, 1992 , pp. 620-627
- Chvátal, V.¹ Reed, B.²

17
- 0024090265
- Many hard examples for resolution
- (1988) J. ACM , vol.35 , pp. 759-768
- Chvátal, V.¹ Szemerédi, E.²

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

19
- 84879542130
- Recognizing more unsatisfiable random 3-SAT instances efficiently
- J. Orejas, P. G. Spirakis, and J. van Leeuwen, eds., Springer-Verlag, Berlin
- (2001) Automata, Languages, and Programming: 28th International Colloquium, Lecture Notes in Comput. Sci. , vol.2076 , pp. 310-321
- Friedman, J.¹ Goerdt, A.²

20
- 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.²

21
- 0033458154
- Sharp thresholds of graph properties, and the k-sat problem
- (1999) J. Amer. Math. Soc. , vol.12 , pp. 1017-1054
- Friedgut, E.¹

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

23
- 0010318125
- Ph.D. thesis, University of Toronto, Toronto, ON, Canada
- (1995) On the Complexity of Proof Systems
- Fu, X.¹

24
- 84957081099
- Efficient recognition of random unsatisfiable k-SAT instances by spectral methods
- Springer-Verlag, Berlin
- (2001) Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science, Lecture Notes in Comput. Sci. , vol.2010 , pp. 294-304
- Goerdt, A.¹ Krivelevich, M.²

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

26
- 0001788107
- Algorithms for the satisfiability (SAT) problem: A survey
- Satisfiability (SAT) Problem, AMS, Providence, RI, 1997 , pp. 19-151
- Gu, J.¹ Purdom, P.W.² Franco, J.³ Wah, B.J.⁴

27
- 0000076101
- The intractàbility of resolution
- (1985) Theoret. Comput. Sci. , vol.39 , pp. 297-305
- Haken, A.¹

28
- 0034403217
- Bounding the unsatisfiability threshold of random 3-SAT
- (2000) Random Structures Algorithms , vol.17 , pp. 103-116
- Janson, S.¹ Stamatiou, Y.C.² Vamvakari, M.³

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

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

31
- 0034826220
- Lower bounds for regular resolution proofs of the weak pigeonhole principle
- Proceedings of the Thirty-Third Annual ACM Symposium on Theory of Computing, Hersonissos, Crete, Greece, 2001 , pp. 347-355
- Pitassi, T.¹ Raz, R.²

32
- 0004024270
- Resolution lower bounds for the weak pigeonhole principle
- Technical Report TR01-021, Electronic Colloquium on Computational Complexity, Universität Trier, Trier, Germany
- (2001)
- Raz, R.¹

33
- 0010363335
- Technical Report TR01-055, Electronic Colloquium on Computational Complexity, Universität Trier, Trier, Germany
- (2001) Improved Resolution Lower Bounds for the Weak Pigeonhole Principle
- Razborov, A.A.¹

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

35
- 0023250297
- Hard examples for resolution
- (1987) J. ACM , vol.34 , pp. 209-219
- Urquhart, A.¹

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