Improved Upper Bounds for 3-SAT

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn 15, Issue , 2004, Pages 321-322

  Iwama, Kazuo ^a   Tamaki, Suguru ^a  

^a KYOTO UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; FUNCTIONS; PROBABILITY; PROBLEM SOLVING; THEOREM PROVING;

HAMMING DISTANCES; RANDOMIZED ALGORITHMS;

DATA STRUCTURES;

EID: 1842539610     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (10)

1. [BS03] S. Baumer and R. Schuler. Improving a probabilistic 3-SAT Algorithm by Dynamic Search and Independent Clause Pairs. ECCC TR03-010, 2003. Also presented at SAT 2003.
2. [DGH+02] E. Dantsin, A. Goerdt, E. A. Hirsch, R. Kannan, J. Kleinberg, C. Papadimitriou, P. Raghavan, and U. Schöning. A deterministic 2 - 2/k+1 algorithm for k-SAT based on local search. TCS, 289(1):69-83, 2002.
3. [HSSW02] T. Hofmeister, U. Schöning, R. Schuler and O. Watanabe. Probabilistic 3-SAT Algorithm Further Improved. Proc. 19th STACS, LNCS 2285, 2002.
4. [Kul99] O. Kullmann, New methods for 3-SAT decision and worst-case analysis. TCS, 223(1-2):1-72, 1999.
5. n steps. Discrete Appl. Math., 10:287-295, 1985.
6. [PPSZ98] R. Paturi, P. Pudlák, M. E. Saks, and F. Zane. An Improved exponential-time algorithm for k-SAT. Proc. 39th FOCS, 1998.
7. [PPZ97] R. Paturi, P. Pudlák, and F. Zane. Satisfiability coding lemma. Proc. 38th FOCS, 1997.
8. n)). ECCC TR03-054, 2003.
9. n steps. CSL 92, LNCS 702, 1992.
10. [Sch99] U. Schöning. A probabilistic algorithm for k-SAT and onstraint satisfaction problems. Proc. 40th FOCS, 1999.