Solving #SAT Using Vertex Covers
暂无分享,去创建一个
[1] Jörg Flum,et al. The Parameterized Complexity of Counting Problems , 2004, SIAM J. Comput..
[2] Eric Horvitz,et al. The Backdoor Key: A Path to Understanding Problem Hardness , 2004, AAAI.
[3] Udi Rotics,et al. On the Clique-Width of Some Perfect Graph Classes , 2000, Int. J. Found. Comput. Sci..
[4] Udi Rotics,et al. On the Clique-Width of Perfect Graph Classes , 1999, WG.
[5] Paul D. Seymour,et al. Approximating clique-width and branch-width , 2006, J. Comb. Theory, Ser. B.
[6] Toby Walsh,et al. Backbones and Backdoors in Satisfiability , 2005, AAAI.
[7] Hans Kleine Büning,et al. Satisfiable Formulas Closed Under Replacement , 2001, Electron. Notes Discret. Math..
[8] Michael R. Fellows,et al. Parameterized Complexity , 1998 .
[9] Georg Gottlob,et al. Fixed-Parameter Algorithms For Artificial Intelligence, Constraint Satisfaction and Database Problems , 2007, Comput. J..
[10] Inês Lynce,et al. Hidden structure in unsatisfiable random 3-SAT: an empirical study , 2004, 16th IEEE International Conference on Tools with Artificial Intelligence.
[11] Rolf Niedermeier,et al. Graph-Modeled Data Clustering: Fixed-Parameter Algorithms for Clique Generation , 2003, CIAC.
[12] Bruno Courcelle,et al. Upper bounds to the clique width of graphs , 2000, Discret. Appl. Math..
[13] Bruno Courcelle,et al. On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic , 2001, Discret. Appl. Math..
[14] Stefan Szeider,et al. Backdoor Sets for DLL Subsolvers , 2005, Journal of Automated Reasoning.
[15] Bruno Courcelle,et al. Linear Time Solvable Optimization Problems on Graphs of Bounded Clique-Width , 2000, Theory of Computing Systems.
[16] Georg Gottlob,et al. Fixed-parameter complexity in AI and nonmonotonic reasoning , 1999, Artif. Intell..
[17] Ge Xia,et al. Improved Parameterized Upper Bounds for Vertex Cover , 2006, MFCS.
[18] Weijia Jia,et al. Vertex Cover: Further Observations and Further Improvements , 2001, J. Algorithms.
[19] Naomi Nishimura,et al. Detecting Backdoor Sets with Respect to Horn and Binary Clauses , 2004, SAT.
[20] Rolf Niedermeier,et al. Invitation to Fixed-Parameter Algorithms , 2006 .
[21] Paul D. Seymour,et al. Graph minors. X. Obstructions to tree-decomposition , 1991, J. Comb. Theory, Ser. B.
[22] Leslie G. Valiant,et al. The Complexity of Computing the Permanent , 1979, Theor. Comput. Sci..
[23] Stefan Szeider,et al. On Fixed-Parameter Tractable Parameterizations of SAT , 2003, SAT.
[24] Kazuo Iwama,et al. CNF Satisfiability Test by Counting and Polynomial Average Time , 1989, SIAM J. Comput..
[25] Marko Samer,et al. Algorithms for Propositional Model Counting , 2007, LPAR.
[26] Toniann Pitassi,et al. Algorithms and complexity results for #SAT and Bayesian inference , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..
[27] Rolf Niedermeier,et al. Graph-Modeled Data Clustering: Exact Algorithms for Clique Generation , 2005, Theory of Computing Systems.
[28] Hans L. Bodlaender,et al. A Partial k-Arboretum of Graphs with Bounded Treewidth , 1998, Theor. Comput. Sci..
[29] Dan Roth,et al. On the Hardness of Approximate Reasoning , 1993, IJCAI.