{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,27]],"date-time":"2026-03-27T03:48:55Z","timestamp":1774583335054,"version":"3.50.1"},"reference-count":14,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1994,10,1]],"date-time":"1994-10-01T00:00:00Z","timestamp":780969600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Artificial Intelligence"],"published-print":{"date-parts":[[1994,10]]},"DOI":"10.1016\/0004-3702(94)90109-0","type":"journal-article","created":{"date-parts":[[2003,3,14]],"date-time":"2003-03-14T13:02:52Z","timestamp":1047646972000},"page":"335-345","source":"Crossref","is-referenced-by-count":59,"title":["Easy problems are sometimes hard"],"prefix":"10.1016","volume":"70","author":[{"given":"Ian P.","family":"Gent","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Toby","family":"Walsh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0004-3702(94)90109-0_BIB1","series-title":"Proceedings Third Annual ACM Symposium on the Theory of Computation","first-page":"151","article-title":"The complexity of theorem proving procedures","author":"Cook","year":"1971"},{"key":"10.1016\/0004-3702(94)90109-0_BIB2","series-title":"Proceedings IJCAI-91","first-page":"163","article-title":"Where the really hard problems are","author":"Cheeseman","year":"1991"},{"key":"10.1016\/0004-3702(94)90109-0_BIB3","series-title":"Proceedings AAAI-93","article-title":"Experimental results on the crossover point in satisfiability problems","author":"Crawford","year":"1993"},{"key":"10.1016\/0004-3702(94)90109-0_BIB4","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1145\/321033.321034","article-title":"A computing procedure for quantification theory","volume":"7","author":"Davis","year":"1960","journal-title":"J. ACM"},{"key":"10.1016\/0004-3702(94)90109-0_BIB5","article-title":"Easy problems are sometimes hard","author":"Gent","year":"1993"},{"key":"10.1016\/0004-3702(94)90109-0_BIB6_1","article-title":"The SAT phase transition","author":"Gent","year":"1994"},{"key":"10.1016\/0004-3702(94)90109-0_BIB6_2","series-title":"Proceedings ECAI-94","year":"1994"},{"key":"10.1016\/0004-3702(94)90109-0_BIB7","series-title":"Proceedings 18th German Annual Conference on Artificial Intelligence","article-title":"The hardest random SAT problems","author":"Gent","year":"1994"},{"key":"10.1016\/0004-3702(94)90109-0_BIB8","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1016\/0004-3702(94)90088-4","article-title":"The hardest constraint problems: a double phase transition","volume":"69","author":"Hogg","year":"1994","journal-title":"Artif. Intell."},{"key":"10.1016\/0004-3702(94)90109-0_BIB9","first-page":"123","article-title":"Branch-and-cut solution of inference problems in propositional logic","volume":"1","author":"Hooker","year":"1990","journal-title":"Ann. Math. AI"},{"key":"10.1016\/0004-3702(94)90109-0_BIB10","first-page":"167","article-title":"Solving propositional satisfiability problems","volume":"1","author":"Jeroslow","year":"1990","journal-title":"Ann. Math. AI"},{"key":"10.1016\/0004-3702(94)90109-0_BIB11","article-title":"Evidence for a satisfiability threshold for random 3CNF formulas","author":"Larrabee","year":"1992"},{"key":"10.1016\/0004-3702(94)90109-0_BIB12","series-title":"Proceedings AAAI-92","article-title":"Hard and easy distributions of SAT problems","author":"Mitchell","year":"1992"},{"issue":"4","key":"10.1016\/0004-3702(94)90109-0_BIB13","doi-asserted-by":"crossref","first-page":"943","DOI":"10.1137\/0214067","article-title":"The pure literal rule and polynomial average time","volume":"14","author":"Purdom","year":"1985","journal-title":"SIAM J. Comput."}],"container-title":["Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0004370294901090?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0004370294901090?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,27]],"date-time":"2019-03-27T00:56:48Z","timestamp":1553648208000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0004370294901090"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,10]]},"references-count":14,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1994,10]]}},"alternative-id":["0004370294901090"],"URL":"https:\/\/doi.org\/10.1016\/0004-3702(94)90109-0","relation":{},"ISSN":["0004-3702"],"issn-type":[{"value":"0004-3702","type":"print"}],"subject":[],"published":{"date-parts":[[1994,10]]}}}