Backdoors to Tractable Valued CSP
暂无分享,去创建一个
[1] Voor Een,et al. The Algebraic Approach , 2005 .
[2] Martin C. Cooper,et al. Tractability in constraint satisfaction problems: a survey , 2016, Constraints.
[3] Stefan Szeider,et al. Backdoors into heterogeneous classes of SAT and CSP , 2017, J. Comput. Syst. Sci..
[4] Stefan Szeider,et al. Augmenting Tractable Fragments of Abstract Argumentation , 2011, IJCAI.
[5] Bart Selman,et al. On the connections between backdoors, restarts, and heavy-tailedness in combinatorial search , 2003 .
[6] Jörg Flum,et al. Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series) , 2006 .
[7] Robert Ganian,et al. The Complexity Landscape of Decompositional Parameters for ILP , 2016, AAAI.
[8] Michal Pilipczuk,et al. Parameterized Algorithms , 2015, Springer International Publishing.
[9] Mihalis Yannakakis,et al. On the Complexity of Database Queries , 1999, J. Comput. Syst. Sci..
[10] Peter Jeavons,et al. The Complexity of Valued Constraint Satisfaction , 2014, Bull. EATCS.
[11] Stanislav Zivny,et al. The Complexity of Valued Constraint Satisfaction Problems , 2012, Cognitive Technologies.
[12] Ashish Sabharwal,et al. Tradeoffs in the Complexity of Backdoor Detection , 2007, CP.
[13] André Platzer,et al. Differential Game Logic , 2014, ACM Trans. Comput. Log..
[14] P. Jeavons,et al. The complexity of constraint satisfaction : an algebraic approach. , 2005 .
[15] Martin C. Cooper,et al. On Backdoors to Tractable Constraint Languages , 2014, CP.
[16] Fedor V. Fomin,et al. The Multivariate Algorithmic Revolution and Beyond , 2012, Lecture Notes in Computer Science.
[17] Naomi Nishimura,et al. Detecting Backdoor Sets with Respect to Horn and Binary Clauses , 2004, SAT.
[18] Robert Ganian,et al. Discovering Archipelagos of Tractability for Constraint Satisfaction and Counting , 2016, SODA.
[19] Stefan Szeider,et al. Backdoors to Normality for Disjunctive Logic Programs , 2013, AAAI.
[20] Toby Walsh,et al. Detecting and Exploiting Subproblem Tractability , 2013, IJCAI.
[21] Stefan Szeider,et al. Backdoors to Satisfaction , 2011, The Multivariate Algorithmic Revolution and Beyond.
[22] Dimitrios M. Thilikos,et al. Invitation to fixed-parameter algorithms , 2007, Comput. Sci. Rev..
[23] Vladimir Kolmogorov,et al. The complexity of conservative valued CSPs , 2011, JACM.
[24] Stefan Szeider,et al. Backdoors to Tractable Answer-Set Programming , 2011, IJCAI.
[25] Bart Selman,et al. Backdoors To Typical Case Complexity , 2003, IJCAI.
[26] Ashish Sabharwal,et al. Backdoors in the Context of Learning , 2009, SAT.
[27] Jörg Flum,et al. Parameterized Complexity Theory , 2006, Texts in Theoretical Computer Science. An EATCS Series.
[28] Ronan Le Bras,et al. Crowdsourcing Backdoor Identification for Combinatorial Optimization , 2013, IJCAI.
[29] Peter Jeavons,et al. The Expressive Power of Valued Constraints: Hierarchies and Collapses , 2007, CP.
[30] Stanislav Živný,et al. Necessary Conditions for Tractability of Valued CSPs , 2015, SIAM Journal on Discrete Mathematics.
[31] Thomas J. Schaefer,et al. The complexity of satisfiability problems , 1978, STOC.
[32] Michael R. Fellows,et al. Fundamentals of Parameterized Complexity , 2013 .