Nonnegative Weighted #CSP: An Effective Complexity Dichotomy

SIAM Journal on Computing ◽

10.1137/15m1032314 ◽

2016 ◽

Vol 45 (6) ◽

pp. 2177-2198 ◽

Author(s):

Jin-Yi Cai ◽

Xi Chen ◽

Pinyan Lu

Keyword(s):

Complexity Dichotomy ◽

Download Full-text

Non-negatively Weighted #CSP: An Effective Complexity Dichotomy

2011 IEEE 26th Annual Conference on Computational Complexity ◽

10.1109/ccc.2011.32 ◽

2011 ◽

Author(s):

Jin-Yi Cai ◽

Xi Chen ◽

Pinyan Lu

Keyword(s):

Complexity Dichotomy ◽

Download Full-text

A full complexity dichotomy for immanant families

Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing ◽

10.1145/3406325.3451124 ◽

2021 ◽

Author(s):

Radu Curticapean

Keyword(s):

Complexity Dichotomy

Download Full-text

A Complexity Dichotomy for Finding Disjoint Solutions of Vertex Deletion Problems

Mathematical Foundations of Computer Science 2009 - Lecture Notes in Computer Science ◽

10.1007/978-3-642-03816-7_28 ◽

2009 ◽

pp. 319-330 ◽

Author(s):

Michael R. Fellows ◽

Jiong Guo ◽

Hannes Moser ◽

Rolf Niedermeier

Keyword(s):

Vertex Deletion ◽

Complexity Dichotomy

Download Full-text

Complexity dichotomy on partial grid recognition

Theoretical Computer Science ◽

10.1016/j.tcs.2011.01.018 ◽

2011 ◽

Vol 412 (22) ◽

pp. 2370-2379

Author(s):

Vinícius G.P. de Sá ◽

Guilherme D. da Fonseca ◽

Raphael C.S. Machado ◽

Celina M.H. de Figueiredo

Keyword(s):

Complexity Dichotomy

Download Full-text

Parameterized Complexity Dichotomy for (r, ℓ)-Vertex Deletion

Theory of Computing Systems ◽

10.1007/s00224-016-9716-y ◽

2016 ◽

Vol 61 (3) ◽

pp. 777-794

Author(s):

Julien Baste ◽

Luerbio Faria ◽

Sulamita Klein ◽

Ignasi Sau

Keyword(s):

Parameterized Complexity ◽

Vertex Deletion ◽

Complexity Dichotomy

Download Full-text

A complexity dichotomy and a new boundary class for the dominating set problem

Journal of Combinatorial Optimization ◽

10.1007/s10878-015-9872-z ◽

2015 ◽

Vol 32 (1) ◽

pp. 226-243 ◽

Author(s):

D. S. Malyshev

Keyword(s):

Dominating Set ◽

Boundary Class ◽

Complexity Dichotomy ◽

Dominating Set Problem

Download Full-text

Complexity dichotomy for oriented homomorphism of planar graphs with large girth

Theoretical Computer Science ◽

10.1016/j.tcs.2015.06.041 ◽

2015 ◽

Vol 596 ◽

pp. 142-148

Author(s):

Guillaume Guégan ◽

Pascal Ochem

Keyword(s):

Planar Graphs ◽

Complexity Dichotomy ◽

Download Full-text

Complete complexity dichotomy for $7$-edge forbidden subgraphs in the edge coloring problem

Diskretnyi analiz i issledovanie operatsii ◽

10.33048/daio.2020.27.682 ◽

2020 ◽

Vol 27 (4) ◽

pp. 104-130

Author(s):

D. S. Malyshev

Keyword(s):

Edge Coloring ◽

Forbidden Subgraphs ◽

Coloring Problem ◽

Complexity Dichotomy

Download Full-text

Anytime Hybrid Best-First Search with Tree Decomposition for Weighted CSP

Lecture Notes in Computer Science - Principles and Practice of Constraint Programming ◽

10.1007/978-3-319-23219-5_2 ◽

2015 ◽

pp. 12-29 ◽

Author(s):

David Allouche ◽

Simon de Givry ◽

George Katsirelos ◽

Thomas Schiex ◽

Matthias Zytnicki

Keyword(s):

Tree Decomposition ◽

Best First Search ◽

Download Full-text

Solving Max-SAT as Weighted CSP

Principles and Practice of Constraint Programming – CP 2003 - Lecture Notes in Computer Science ◽

10.1007/978-3-540-45193-8_25 ◽

2003 ◽

pp. 363-376 ◽

Author(s):

Simon de Givry ◽

Javier Larrosa ◽

Pedro Meseguer ◽

Thomas Schiex

Keyword(s):

Max Sat ◽

Download Full-text