{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T03:08:38Z","timestamp":1761620918258},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"1-3","license":[{"start":{"date-parts":[[2006,1,19]],"date-time":"2006-01-19T00:00:00Z","timestamp":1137628800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Autom Reasoning"],"published-print":{"date-parts":[[2006,10,5]]},"DOI":"10.1007\/s10817-005-9007-9","type":"journal-article","created":{"date-parts":[[2006,1,18]],"date-time":"2006-01-18T12:33:04Z","timestamp":1137587584000},"page":"73-88","source":"Crossref","is-referenced-by-count":15,"title":["Backdoor Sets for DLL Subsolvers"],"prefix":"10.1007","volume":"35","author":[{"given":"Stefan","family":"Szeider","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2006,1,19]]},"reference":[{"issue":"3","key":"9007_CR1","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/0168-0072(94)00034-Z","volume":"73","author":"K. A. Abrahamson","year":"1995","unstructured":"Abrahamson, K. A., Downey, R. G. and Fellows, M. R. (1995) Fixed-parameter tractability and completeness. IV. On completeness for W[P] and PSPACE analogues, Ann. Pure Appl. Logic 73(3), 235\u2013276.","journal-title":"Ann. Pure Appl. Logic"},{"key":"9007_CR2","unstructured":"Cook, S. A. and Mitchell, D. G. (1997) Finding hard instances of the satisfiability problem: A survey, in Satisfiability problem: theory and applications (Piscataway, NJ, 1996), American Mathematical Society, pp. 1\u201317."},{"key":"9007_CR3","doi-asserted-by":"crossref","first-page":"394","DOI":"10.1145\/368273.368557","volume":"5","author":"M. Davis","year":"1962","unstructured":"Davis, M., Logemann, G. and Loveland, D. A (1962) machine program for theorem-proving, Commun. ACM 5, 394\u2013397.","journal-title":"Commun. ACM"},{"issue":"3","key":"9007_CR4","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1145\/321033.321034","volume":"7","author":"M. Davis","year":"1960","unstructured":"Davis, M. and Putnam, H. (1960) A computing procedure for quantification theory, J. ACM 7(3), 201\u2013215.","journal-title":"J. ACM"},{"key":"9007_CR5","doi-asserted-by":"crossref","unstructured":"Downey, R. G. and Fellows, M. R. (1999) Parameterized Complexity, Monographs in Computer Science. Springer.","DOI":"10.1007\/978-1-4612-0515-9"},{"key":"9007_CR6","first-page":"71","volume":"84","author":"J. Flum","year":"2004","unstructured":"Flum, J. and Grohe, M. (2004) Parameterized complexity and subexponential time, Bull. Eur. Assoc. Theor. Comput. Sci. 84, 71\u2013100.","journal-title":"Bull. Eur. Assoc. Theor. Comput. Sci."},{"key":"9007_CR7","unstructured":"Interian, Y. (2003) Backdoor sets for random 3-SAT, in Sixth International Conference on Theory and Applications of Satisfiability Testing, S. Margherita Ligure, Portofino, Italy, May 5\u20138, 2003, (SAT 2003), informal proceedings, pp. 231\u2013238."},{"issue":"7","key":"9007_CR8","doi-asserted-by":"crossref","first-page":"950","DOI":"10.1109\/43.293952","volume":"13","author":"S. Malik","year":"1994","unstructured":"Malik, S. (1994) Analysis of Cyclic Combinatorial Circuits, IEEE Trans. Comput.-Aided Des. 13(7), 950\u2013956.","journal-title":"IEEE Trans. Comput.-Aided Des."},{"key":"9007_CR9","unstructured":"Nishimura, N., Ragde, P. and Szeider, S. (2004) Detecting backdoor sets with respect to Horn and binary clauses, in H. Hoos and D. G. Mitchell (eds.), Seventh International Conference on Theory and Applications of Satisfiability Testing, 10\u201313 May, 2004, Vancouver, BC, Canada (SAT 2004), informal proceedings, pp. 96\u2013103."},{"key":"9007_CR10","unstructured":"Ruan, Y., Kautz, H. A. and Horvitz, E. (2004) The backdoor key: A path to understanding problem hardness, in D. L. McGuinness and G. Ferguson (eds.), Proceedings of the 19th National Conference on Artificial Intelligence, 16th Conference on Innovative Applications of Artificial Intelligence, pp. 124\u2013130."},{"key":"9007_CR11","unstructured":"Williams, R., Gomes, C. and Selman, B. (2003a) Backdoors to typical case complexity, in G. Gottlob and T. Walsh (eds.), Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence, IJCAI 2003, pp. 1173\u20131178."},{"key":"9007_CR12","unstructured":"Williams, R., Gomes, C. and Selman, B. (2003b) On the connections between backdoors, restarts, and heavy-tailedness in combinatorial search, in Sixth International Conference on Theory and Applications of Satisfiability Testing, S. Margherita Ligure, Portofino, Italy, May 5\u20138, 2003 (SAT 2003), informal proceedings, pp. 222\u2013230."}],"container-title":["Journal of Automated Reasoning"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10817-005-9007-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10817-005-9007-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10817-005-9007-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T01:21:46Z","timestamp":1559265706000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10817-005-9007-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,1,19]]},"references-count":12,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2006,10,5]]}},"alternative-id":["9007"],"URL":"https:\/\/doi.org\/10.1007\/s10817-005-9007-9","relation":{},"ISSN":["0168-7433","1573-0670"],"issn-type":[{"value":"0168-7433","type":"print"},{"value":"1573-0670","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,1,19]]}}}