Detecting and Exploiting Subproblem Tractability
暂无分享,去创建一个
[1] Hubie Chen,et al. Arc consistency and friends , 2011, J. Log. Comput..
[2] Andrei A. Bulatov,et al. A Simple Algorithm for Mal'tsev Constraints , 2006, SIAM J. Comput..
[3] Michael R. Fellows,et al. Parameterized complexity: A framework for systematically confronting computational intractability , 1997, Contemporary Trends in Discrete Mathematics.
[4] Marc Gyssens,et al. Closure properties of constraints , 1997, JACM.
[5] Andrei A. Bulatov,et al. Mal'tsev constraints are tractable , 2002, Electron. Colloquium Comput. Complex..
[6] Justyna Petke,et al. Tractable Benchmarks For Constraint Programming , 2009 .
[7] Eugene C. Freuder. A Sufficient Condition for Backtrack-Free Search , 1982, JACM.
[8] Michael R. Fellows,et al. An Improved Fixed-Parameter Algorithm for Vertex Cover , 1998, Inf. Process. Lett..
[9] Christian Bessiere,et al. Efficient algorithms for singleton arc consistency , 2009, Constraints.
[10] Olivier Roussel,et al. XML Representation of Constraint Networks: Format XCSP 2.1 , 2009, ArXiv.
[11] Bart Selman,et al. Backdoors To Typical Case Complexity , 2003, IJCAI.
[12] Christian Bessiere,et al. Theoretical analysis of singleton arc consistency and its extensions , 2008, Artif. Intell..