Capturing Structure in Hard Combinatorial Problems (Invited Keynote Talk)
暂无分享,去创建一个
[1] Stefan Szeider,et al. The Parameterized Complexity of Local Consistency , 2011, CP.
[2] Bart Selman,et al. Backdoors To Typical Case Complexity , 2003, IJCAI.
[3] Stefan Szeider,et al. Parameterized Complexity Results for Plan Reuse , 2013, AAAI.
[4] Stefan Szeider,et al. Parameterized Complexity Results for Exact Bayesian Network Structure Learning , 2014, J. Artif. Intell. Res..
[5] Marko Samer,et al. Constraint satisfaction with bounded treewidth revisited , 2010, J. Comput. Syst. Sci..
[6] Graham Wrightson,et al. On finding short resolution refutations and small unsatisfiable subsets , 2006, Theor. Comput. Sci..
[7] Daniël Paulusma,et al. Satisfiability of acyclic and almost acyclic CNF formulas , 2011, Theor. Comput. Sci..
[8] Peter van Beek,et al. Finding Small Backdoors in SAT Instances , 2011, Canadian Conference on AI.
[9] Rolf Niedermeier,et al. Invitation to Fixed-Parameter Algorithms , 2006 .
[10] Michael R. Fellows,et al. Parameterized Complexity , 1998 .
[11] Stefan Rümmele,et al. Tractable answer-set programming with weight constraints: bounded treewidth is not enough* , 2010, Theory and Practice of Logic Programming.
[12] Stefan Szeider,et al. Algorithms and complexity results for persuasive argumentation , 2010, Artif. Intell..
[13] Armin Biere,et al. Symbolic Model Checking without BDDs , 1999, TACAS.
[14] Stefan Szeider,et al. Backdoors to Normality for Disjunctive Logic Programs , 2013, AAAI.
[15] Stefan Szeider,et al. Backdoors to Satisfaction , 2011, The Multivariate Algorithmic Revolution and Beyond.
[16] Noga Alon,et al. Solving MAX-r-SAT Above a Tight Lower Bound , 2010, SODA '10.
[17] Jörg Flum,et al. Parameterized Complexity Theory , 2006, Texts in Theoretical Computer Science. An EATCS Series.