scientific article; zbMATH DE number 6825406

DOI10.23638/LMCS-13(4:26)2017MaRDI QIDQ4600768zbMATH OpenFDO

Authors M. C. Cooper, S. Zivny

Publication date 12 January 2018

Full work available at URL https://arxiv.org/abs/1604.07981

zbMATH Keywords

arc consistencyconstraint satisfaction problemforbidden patterntractability

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• The Power of Arc Consistency for CSPs Defined by Partially-Ordered Forbidden Patterns
• A new class of binary CSPs for which arc-consistency is a decision procedure
• The tractability of CSP classes defined by forbidden patterns
• Bounds arc consistency for weighted CSPs
• Methods and Applications of Artificial Intelligence
• scientific article; zbMATH DE number 67482
• A fine-grained arc-consistency algorithm for non-normalized constraint satisfaction problems
• On singleton arc consistency for CSPs defined by monotone patterns
• On singleton arc consistency for CSPs defined by monotone patterns

Cited in

(8)

• Binary constraint satisfaction problems defined by excluded topological minors
• On singleton arc consistency for CSPs defined by monotone patterns
• Galois connections for patterns: an algebra of labelled graphs
• Regular pattern-free coloring
• Characterising the complexity of constraint satisfaction problems defined by 2-constraint forbidden patterns
• The tractability of CSP classes defined by forbidden patterns
• On singleton arc consistency for CSPs defined by monotone patterns
• The Power of Arc Consistency for CSPs Defined by Partially-Ordered Forbidden Patterns

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4600768)