{"type":"ScholarlyArticle","title":"On the Space-Time Trade-off in Solving Constraint Satisfaction Problems","authors":[{"name":"Roberto J. Bayardo Jr.","slug":"roberto-j-bayardo-jr","given":"Roberto J. Bayardo","family":"Jr.","affiliation":""},{"name":"Daniel P. Miranker","slug":"daniel-p-miranker","given":"Daniel P.","family":"Miranker","affiliation":""}],"abstract":"A common technique for bounding the runtime required to solve a constraint satisfaction problem is to exploit the structure of the problem's constraint graph [Dechter, 92]. We show that a simple structure-based technique with a minimal space requirement, pseudo-tree search [Freuder & Quinn, 85], is capable of bounding runtime almost as effectively as the best exponential space-consuming schemes. Specifically, if we let n denote the number of variables in the problem, w* denote the exponent in the complexity function of the best structure-based techniques, and h denote the exponent from pseudotree search, we show h ~ (w* +I) (lg(n) + 1) . The result should allow reductions in the amount of real-time accessible memory required for predicting runtime when solving CSP equivalent problems.","doi":null,"url":"https://ijcai.org/proceedings/1995/73","pdf":"https://ijcai.org/proceedings/1995/0073.pdf","markdown":"https://ijcai.org/proceedings/1995/73.md","bibtex":"https://ijcai.org/proceedings/1995/bibtex/73","volume":{"slug":"1995","title":"Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 1995","url":"https://ijcai.org/proceedings/1995/","year":1995,"location":"Montréal, Québec, Canada","dates":"","editors":"Chris S. Mellish","isbn":"","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":"Constraint Satisfaction","track":"Constraint Satisfaction","number":73,"pages":{"first":558,"last":561},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}