{"type":"ScholarlyArticle","title":"Computational Complexity of Multi-way, Dataflow Constraint Problems","authors":[{"name":"Gilles Trombettoni","slug":"gilles-trombettoni","given":"Gilles","family":"Trombettoni","affiliation":""},{"name":"Bertrand Neveu","slug":"bertrand-neveu","given":"Bertrand","family":"Neveu","affiliation":""}],"abstract":"Although it is acknowledged that multi-way dataflow constraints are useful in interactive applications, concerns about their tractability have hindered their acceptance. Certain local propagation algorithms that solve these constraints are polynomial, others (such as SkyBlue) are exponential. Every system handles a specific problem and the influence of any particular restriction on the computational complexity is not yet precisely determined. In this paper, we present three theoretical results that allow us to classify existing multi-way constraint problems. Especially, we prove that the problem handled by SkyBlue is NP-hard.","doi":null,"url":"https://ijcai.org/proceedings/1997/53","pdf":"https://ijcai.org/proceedings/1997/0053.pdf","markdown":"https://ijcai.org/proceedings/1997/53.md","bibtex":"https://ijcai.org/proceedings/1997/bibtex/53","volume":{"slug":"1997","title":"Proceedings of the Fifteenth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 1997","url":"https://ijcai.org/proceedings/1997/","year":1997,"location":"Nagoya, Japan","dates":"","editors":"Martha E. Pollack","isbn":"","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":"Constraint Satisfaction","track":"Constraint Satisfaction","number":53,"pages":{"first":358,"last":364},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}