暂无分享,去创建一个
[1] H. Wilf. generatingfunctionology: Third Edition , 1990 .
[2] F. MacWilliams,et al. The Theory of Error-Correcting Codes , 1977 .
[3] Daniel Rolf,et al. Improved Bound for the PPSZ/Schöning-Algorithm for 3-SAT , 2006, J. Satisf. Boolean Model. Comput..
[4] Patrick Traxler. The Time Complexity of Constraint Satisfaction , 2008, IWPEC.
[5] Rajeev Motwani,et al. Worst-case time bounds for coloring and satisfiability problems , 2002, J. Algorithms.
[6] Andrei Giurgiu,et al. Random walk algorithms for SAT , 2009 .
[7] Kazuo Iwama,et al. Improved upper bounds for 3-SAT , 2004, SODA '04.
[8] U. Schöning. A probabilistic algorithm for k-SAT and constraint satisfaction problems , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).
[9] Pavel Pudlák,et al. Satisfiability Coding Lemma , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.
[10] Dorit S. Hochbaum,et al. Approximation Algorithms for NP-Hard Problems , 1996 .
[11] Michael E. Saks,et al. An improved exponential-time algorithm for k-SAT , 2005, JACM.
[12] Walter Kern,et al. An improved local search algorithm for 3-SAT , 2004, Electron. Notes Discret. Math..
[13] Jon M. Kleinberg,et al. A deterministic (2-2/(k+1))n algorithm for k-SAT based on local search , 2002, Theor. Comput. Sci..
[14] Dominik Scheder,et al. Guided Search and a Faster Deterministic Algorithm for 3-SAT , 2008, LATIN.
[15] Russell Impagliazzo,et al. Which Problems Have Strongly Exponential Complexity? , 2001, J. Comput. Syst. Sci..
[16] J. Davenport. Editor , 1960 .