Periodic constraint satisfaction problems: polynomial-time algorithms

DOI10.1007/B13743MaRDI QIDQ5897197zbMATH OpenOpenAlexFDO

Authors Hubie Chen

Publication date 2 March 2010

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b13743

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• Periodic constraint satisfaction problems: Tractable subclasses
• Characterising tractable constraints
• A proof of the CSP dichotomy conjecture
• scientific article; zbMATH DE number 1008453
• A dichotomy theorem for constraint satisfaction problems on a 3-element set

Cited in

(3)

• scientific article; zbMATH DE number 1335885 (Why is no real title available?)
• Logic Programming
• Periodic constraint satisfaction problems: Tractable subclasses

This page was built for publication: Periodic constraint satisfaction problems: polynomial-time algorithms

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