Regular Random k-SAT: Properties of Balanced Formulas
暂无分享,去创建一个
Bart Selman | Yannet Interian | Olivier Dubois | Yacine Boufkhad | B. Selman | Yacine Boufkhad | Y. Interian | O. Dubois
[1] Roberto J. Bayardo,et al. Using CSP Look-Back Techniques to Solve Exceptionally Hard SAT Instances , 1996, CP.
[2] Alan M. Frieze,et al. Random graphs , 2006, SODA '06.
[3] E. Friedgut,et al. Sharp thresholds of graph properties, and the -sat problem , 1999 .
[4] Svante Janson,et al. Random graphs , 2000, ZOR Methods Model. Oper. Res..
[5] Olivier Dubois,et al. Typical random 3-SAT formulae and the satisfiability threshold , 2000, SODA '00.
[6] Yuval Peres,et al. The threshold for random k-SAT is 2k (ln 2 - O(k)) , 2003, STOC '03.
[7] Bruce A. Reed,et al. Mick gets some (the odds are on his side) (satisfiability) , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.
[8] Cristopher Moore,et al. The asymptotic order of the random k-SAT threshold , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..
[9] Olivier Dubois,et al. Upper bounds on the satisfiability threshold , 2001, Theor. Comput. Sci..
[10] Bart Selman,et al. Balance and Filtering in Structured Satisfiable Problems (Preliminary Report) , 2001, Electron. Notes Discret. Math..
[11] N. Wormald. Differential Equations for Random Processes and Random Graphs , 1995 .
[12] Gilles Dequen,et al. A backbone-search heuristic for efficient solving of hard 3-SAT formulae , 2001, IJCAI.
[13] Yannis C. Stamatiou,et al. Approximating the unsatisfiability threshold of random formulas , 1998, Random Struct. Algorithms.
[14] Alan M. Frieze,et al. A note on random 2-SAT with prescribed literal degrees , 2002, SODA '02.
[15] Hector J. Levesque,et al. Hard and Easy Distributions of SAT Problems , 1992, AAAI.
[16] L. Kirousis,et al. Approximating the unsatisfiability threshold of random formulas , 1998 .
[17] Dimitris Achlioptas,et al. THE THRESHOLD FOR RANDOM k-SAT IS 2k log 2 O(k) , 2004, FOCS 2004.
[18] Yacine Boufkhad,et al. A General Upper Bound for the Satisfiability Threshold of Random r-SAT Formulae , 1997, J. Algorithms.
[19] Lefteris M. Kirousis,et al. The probabilistic analysis of a greedy satisfiability algorithm , 2002, Random Struct. Algorithms.
[20] Andreas Goerdt,et al. A Threshold for Unsatisfiability , 1992, MFCS.
[21] Dimitris Achlioptas,et al. Lower bounds for random 3-SAT via differential equations , 2001, Theor. Comput. Sci..
[22] Lefteris M. Kirousis,et al. Selecting Complementary Pairs of Literals , 2003, Electron. Notes Discret. Math..
[23] Bart Selman,et al. Balance and Filtering in Structured Satisfiable Problems , 2001, IJCAI.
[24] Béla Bollobás,et al. Random Graphs: Notation , 2001 .
[25] Gregory B. Sorkin,et al. IBM Research Report The Satisfiability Threshold of Random 3-SAT Is at Least 3.52 , 2003 .
[26] Endre Szemerédi,et al. Many hard examples for resolution , 1988, JACM.
[27] Svante Janson,et al. Random graphs , 2000, Wiley-Interscience series in discrete mathematics and optimization.
[28] Bart Selman,et al. Generating Satisfiable Problem Instances , 2000, AAAI/IAAI.