On the Equivalence among Problems of Bounded Width
暂无分享,去创建一个
[1] Stefan Arnborg,et al. Efficient Algorithms for Combinatorial Problems with Bounded Decomposability - A Survey. , 1985 .
[2] Andreas Björklund,et al. Determinant Sums for Undirected Hamiltonicity , 2010, 2010 IEEE 51st Annual Symposium on Foundations of Computer Science.
[3] Bruno Courcelle,et al. Linear Time Solvable Optimization Problems on Graphs of Bounded Clique Width , 1998, WG.
[4] Bruno Courcelle,et al. Linear Time Solvable Optimization Problems on Graphs of Bounded Clique-Width , 2000, Theory of Computing Systems.
[5] Ryan Williams,et al. A new algorithm for optimal 2-constraint satisfaction and its implications , 2005, Theor. Comput. Sci..
[6] Hiroshi Nagamochi,et al. Exact Algorithms for Maximum Independent Set , 2013, ISAAC.
[7] Michal Pilipczuk,et al. Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time , 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.
[8] Mihai Patrascu,et al. On the possibility of faster SAT algorithms , 2010, SODA '10.
[9] 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).
[10] Dimitrios M. Thilikos,et al. A Note on Exact Algorithms for Vertex Ordering Problems on Graphs , 2012, Theory of Computing Systems.
[11] Djamal Habet,et al. A Tree Decomposition Based Approach to Solve Structured SAT Instances , 2009, 2009 21st IEEE International Conference on Tools with Artificial Intelligence.
[12] Sanjeev Arora,et al. Computational Complexity: A Modern Approach , 2009 .
[13] Timon Hertli,et al. 3-SAT Faster and Simpler - Unique-SAT Bounds for PPSZ Hold in General , 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.
[14] Dimitrios M. Thilikos,et al. Invitation to fixed-parameter algorithms , 2007, Comput. Sci. Rev..
[15] Jörg Flum,et al. Describing parameterized complexity classes , 2002, Inf. Comput..
[16] Piotr Indyk,et al. Edit Distance Cannot Be Computed in Strongly Subquadratic Time (unless SETH is false) , 2014, STOC.
[17] Dániel Marx,et al. Known algorithms on graphs of bounded treewidth are probably optimal , 2010, SODA '11.
[18] Stefan Arnborg,et al. Efficient algorithms for combinatorial problems on graphs with bounded decomposability — A survey , 1985, BIT.
[19] Udi Rotics,et al. On the Relationship between Clique-Width and Treewidth , 2001, WG.
[20] Peter Rossmanith,et al. Dynamic Programming on Tree Decompositions Using Generalised Fast Subset Convolution , 2009, ESA.
[21] Yoshio Okamoto,et al. On Problems as Hard as CNF-SAT , 2011, 2012 IEEE 27th Conference on Computational Complexity.
[22] Russell Impagliazzo,et al. Which problems have strongly exponential complexity? , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).