暂无分享,去创建一个
[1] Michael E. Saks,et al. An improved exponential-time algorithm for k-SAT , 2005, JACM.
[2] Alasdair Urquhart,et al. Formal Languages]: Mathematical Logic--mechanical theorem proving , 2022 .
[3] Russell Impagliazzo,et al. Complexity of kSAT , 2007 .
[4] M. Murty. Ramanujan Graphs , 1965 .
[5] Dominik Scheder,et al. Exponential Lower Bounds for the PPSZ k-SAT Algorithm , 2013, SODA.
[6] Piotr Indyk,et al. Edit Distance Cannot Be Computed in Strongly Subquadratic Time (unless SETH is false) , 2014, STOC.
[7] 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).
[8] Timon Hertli. 3-SAT Faster and Simpler - Unique-SAT Bounds for PPSZ Hold in General , 2014, SIAM J. Comput..
[9] Eli Ben-Sasson,et al. Random Cnf’s are Hard for the Polynomial Calculus , 2010, computational complexity.
[10] Pavel Pudlák,et al. Satisfiability Coding Lemma , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.
[11] G. S. Tseitin. On the Complexity of Derivation in Propositional Calculus , 1983 .
[12] Russell Impagliazzo,et al. Complexity of k-SAT , 1999, Proceedings. Fourteenth Annual IEEE Conference on Computational Complexity (Formerly: Structure in Complexity Theory Conference) (Cat.No.99CB36317).
[13] Timon Hertli,et al. 3-SAT Faster and Simpler - Unique-SAT Bounds for PPSZ Hold in General , 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.
[14] Jon M. Kleinberg,et al. A deterministic (2-2/(k+1))n algorithm for k-SAT based on local search , 2002, Theor. Comput. Sci..
[15] Dániel Marx,et al. Lower bounds based on the Exponential Time Hypothesis , 2011, Bull. EATCS.