相关参考文献
注意：仅列出部分参考文献，下载原文获取全部文献信息。The Number of Satisfying Assignments of Random Regular k-SAT Formulas
Amin Coja-Oghlan et al.
COMBINATORICS PROBABILITY & COMPUTING (2018)
ON THE COMPLEXITY OF RANDOM SATISFIABILITY PROBLEMS WITH PLANTED SOLUTIONS
Vitaly Feldman et al.
SIAM JOURNAL ON COMPUTING (2018)
Time Complexity Analysis of Evolutionary Algorithms on Random Satisfiable k-CNF Formulas
Benjamin Doerr et al.
ALGORITHMICA (2017)
Generating SAT instances with community structure
Jesus Giraldez-Cru et al.
ARTIFICIAL INTELLIGENCE (2016)
Phase Transition for Local Search on Planted SAT
Andrei A. Bulatov et al.
MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2015, PT II (2015)
A spectral technique for random satisfiable 3CNF formulas
Abraham Flaxman
RANDOM STRUCTURES & ALGORITHMS (2008)
Regular random k-SAT:: Properties of balanced formulas
Yacine Boufkhad et al.
JOURNAL OF AUTOMATED REASONING (2005)
Hiding satisfying assignments: Two are better than one
D Achlioptas et al.
JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH (2005)
Rigorous results for random (2+p)-SAT
D Achlioptas et al.
THEORETICAL COMPUTER SCIENCE (2001)
分享论文
