{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T06:02:18Z","timestamp":1648792938641},"reference-count":17,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2001,10,1]],"date-time":"2001-10-01T00:00:00Z","timestamp":1001894400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":4343,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Artificial Intelligence"],"published-print":{"date-parts":[[2001,10]]},"DOI":"10.1016\/s0004-3702(01)00146-1","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T13:00:41Z","timestamp":1027602041000},"page":"105-117","source":"Crossref","is-referenced-by-count":0,"title":["Determining if (FC-) (conflict-directed) backjumping visits a given node is NP-hard"],"prefix":"10.1016","volume":"132","author":[{"given":"Bernd S.W.","family":"Schr\u00f6der","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0004-3702(01)00146-1_BIB001","series-title":"Principles and Practices in Constraint Programming (CP-95)","first-page":"292","article-title":"On the forward checking algorithm","volume":"976","author":"Bacchus","year":"1995"},{"key":"10.1016\/S0004-3702(01)00146-1_BIB002","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1137\/0221022","article-title":"Heuristic sampling: A method for predicting the performance of tree searching programs","volume":"21","author":"Chen","year":"1992","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0004-3702(01)00146-1_BIB003","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1613\/jair.788","article-title":"Conflict-directed backjumping revisited","volume":"14","author":"Chen","year":"2001","journal-title":"J. Artificial Intelligence Res."},{"key":"10.1016\/S0004-3702(01)00146-1_BIB004","series-title":"Encyclopedia of Artificial Intelligence","first-page":"276","article-title":"Constraint networks","author":"Dechter","year":"1992"},{"key":"10.1016\/S0004-3702(01)00146-1_BIB005","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/S0004-3702(01)00146-1_BIB006","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1016\/0004-3702(80)90051-X","article-title":"Increasing tree search efficiency for constraint satisfaction problems","volume":"14","author":"Haralick","year":"1980","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(01)00146-1_BIB007","doi-asserted-by":"crossref","first-page":"121","DOI":"10.2307\/2005469","article-title":"Estimating the efficiency of backtrack programs","volume":"29","author":"Knuth","year":"1975","journal-title":"Math. Comp."},{"key":"10.1016\/S0004-3702(01)00146-1_BIB008","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1016\/S0004-3702(96)00027-6","article-title":"A theoretical evaluation of selected backtracking algorithms","volume":"89","author":"Kondrak","year":"1997","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(01)00146-1_BIB009","unstructured":"T. Kulkarni, Experimental evaluation of selected algorithms for estimating the cost of solving a Constraint Satisfaction Problem, M.Sc. thesis, Computer Science, Louisiana Tech University, Ruston, LA, 2001"},{"key":"10.1016\/S0004-3702(01)00146-1_BIB010","series-title":"Encyclopedia of Artificial Intelligence","first-page":"284","article-title":"Constraint satisfaction","author":"Mackworth","year":"1992"},{"key":"10.1016\/S0004-3702(01)00146-1_BIB011","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/S0004-3702(83)80008-3","article-title":"Consistent-labeling problems and their algorithms: Expected-complexities and theory-based heuristics","volume":"21","author":"Nudel","year":"1983","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(01)00146-1_BIB012","doi-asserted-by":"crossref","first-page":"268","DOI":"10.1111\/j.1467-8640.1993.tb00310.x","article-title":"Hybrid algorithms for the constraint satisfaction problem","volume":"9","author":"Prosser","year":"1993","journal-title":"Comput. Intell."},{"key":"10.1016\/S0004-3702(01)00146-1_BIB013","unstructured":"P. Prosser, MAC\u2013CBJ: maintaining arc consistency with conflict directed backjumping, Strathclyde University Department of Computer Science Research Report 95\/177, 1995"},{"key":"10.1016\/S0004-3702(01)00146-1_BIB014","doi-asserted-by":"crossref","first-page":"481","DOI":"10.1137\/0207038","article-title":"Tree size by partial backtracking","volume":"7","author":"Purdom","year":"1978","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0004-3702(01)00146-1_BIB015","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/0004-3702(95)00052-6","article-title":"Locating the phase transition in binary constraint satisfaction problems","volume":"81","author":"Smith","year":"1996","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(01)00146-1_BIB016","series-title":"Foundations of Constraint Satisfaction","author":"Tsang","year":"1993"},{"key":"10.1016\/S0004-3702(01)00146-1_BIB017","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/0004-3702(94)90104-X","article-title":"Exploiting the deep structure of constraint problems","volume":"70","author":"Williams","year":"1994","journal-title":"Artificial Intelligence"}],"container-title":["Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0004370201001461?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0004370201001461?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,12]],"date-time":"2020-01-12T08:43:17Z","timestamp":1578818597000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0004370201001461"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,10]]},"references-count":17,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2001,10]]}},"alternative-id":["S0004370201001461"],"URL":"https:\/\/doi.org\/10.1016\/s0004-3702(01)00146-1","relation":{},"ISSN":["0004-3702"],"issn-type":[{"value":"0004-3702","type":"print"}],"subject":[],"published":{"date-parts":[[2001,10]]}}}