A duality between clause width and clause density for SAT
暂无分享,去创建一个
[1] S Kirkpatrick,et al. Critical Behavior in the Satisfiability of Random Boolean Expressions , 1994, Science.
[2] Michael E. Saks,et al. On the complexity of unsatisfiability proofs for random k-CNF formulas , 1998, STOC '98.
[3] PaturiRamamohan,et al. An improved exponential-time algorithm for k-SAT , 2005 .
[4] Rainer Schuler,et al. An algorithm for the satisfiability problem of formulas in conjunctive normal form , 2005, J. Algorithms.
[5] Michael E. Saks,et al. An improved exponential-time algorithm for k-SAT , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).
[6] Yuval Peres,et al. The threshold for random k-SAT is 2k (ln 2 - O(k)) , 2003, STOC '03.
[7] Vikraman Arvind,et al. The Quantum Query Complexity of 0-1 Knapsack and Associated Claw Problems , 2003, ISAAC.
[8] Michael Alekhnovich,et al. Exponential Lower Bounds for the Running Time of DPLL Algorithms on Satisfiable Formulas , 2004, SODA '04.
[9] Richard J. Lipton,et al. On the complexity of SAT , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).
[10] 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).
[11] David S. Johnson,et al. What are the least tractable instances of max independent set? , 1999, SODA '99.
[12] Russell Impagliazzo,et al. The complexity of unique k-SAT: an isolation lemma for k-CNFs , 2003, 18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings..
[13] Uwe Schöning,et al. A Probabilistic Algorithm for k -SAT Based on Limited Local Search and Restart , 2002, Algorithmica.
[14] Alan M. Frieze,et al. Analysis of Two Simple Heuristics on a Random Instance of k-SAT , 1996, J. Algorithms.
[15] 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..
[16] Michael R. Fellows,et al. Fixed-parameter intractability , 1992, [1992] Proceedings of the Seventh Annual Structure in Complexity Theory Conference.
[17] Pavel Pudlák,et al. Satisfiability Coding Lemma , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.
[18] E. Friedgut,et al. Sharp thresholds of graph properties, and the -sat problem , 1999 .
[19] Russell Impagliazzo,et al. Which problems have strongly exponential complexity? , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).