{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T04:53:14Z","timestamp":1725511994212},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540797180"},{"type":"electronic","value":"9783540797197"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-79719-7_9","type":"book-chapter","created":{"date-parts":[[2008,5,6]],"date-time":"2008-05-06T08:04:57Z","timestamp":1210061097000},"page":"91-104","source":"Crossref","is-referenced-by-count":1,"title":["Random Instances of W[2]-Complete Problems: Thresholds, Complexity, and Algorithms"],"prefix":"10.1007","author":[{"given":"Yong","family":"Gao","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"9_CR1","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0515-9","volume-title":"Parameterized Complexity","author":"R. Downey","year":"1999","unstructured":"Downey, R., Fellows, M.: Parameterized Complexity. Springer, Heidelberg (1999)"},{"key":"9_CR2","doi-asserted-by":"crossref","DOI":"10.1093\/acprof:oso\/9780198566076.001.0001","volume-title":"Invitation to Fixed-Parameter Algorithms","author":"R. Neidermeier","year":"2006","unstructured":"Neidermeier, R.: Invitation to Fixed-Parameter Algorithms. Oxford University Press, Oxford (2006)"},{"key":"9_CR3","doi-asserted-by":"crossref","unstructured":"Gottlob, G., Szeider, S.: Fixed-parameter algorithms for artificial intelligence, constraint satisfaction, and database problems. The Computer Journal (to appear)","DOI":"10.1093\/comjnl\/bxm056"},{"key":"9_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1007\/978-3-540-74970-7_20","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2007","author":"B. Dilkina","year":"2007","unstructured":"Dilkina, B., Gomes, C., Sabharwal, A.: Tradeoffs in the complexity of backdoor detection. In: Bessi\u00e8re, C. (ed.) CP 2007. LNCS, vol.\u00a04741, pp. 256\u2013270. Springer, Heidelberg (2007)"},{"issue":"3","key":"9_CR5","first-page":"73","volume":"1-","author":"S. Szeider","year":"2005","unstructured":"Szeider, S.: Backdoor sets for DLL subsolvers. Journal of Automated Reasoning (1-3) 73\u201388 (2005)","journal-title":"Journal of Automated Reasoning"},{"key":"9_CR6","series-title":"Lecture Notes in Computer Science","volume-title":"Theory and Applications of Satisfiability Testing","author":"N. Nishimura","year":"2005","unstructured":"Nishimura, N., Ragde, P., Szeider, S.: Detecting backdoor sets with respect to horn and binary clauses. In: H. Hoos, H., Mitchell, D.G. (eds.) SAT 2004. LNCS, vol.\u00a03542, Springer, Heidelberg (2005)"},{"key":"9_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"222","DOI":"10.1007\/b98625","volume-title":"Theory and Applications of Satisfiability Testing","author":"R. Williams","year":"2004","unstructured":"Williams, R., Gomes, G., Selman, B.: On the connections between heanvy-tails, backdoors, and restarts in combinatorial search. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol.\u00a02919, pp. 222\u2013230. Springer, Heidelberg (2004)"},{"key":"9_CR8","first-page":"150","volume-title":"Proceedings of FOCS 2007","author":"S. Dantchev","year":"2007","unstructured":"Dantchev, S., Martin, B., Szeider, S.: Parameterized proof complexity. In: Proceedings of FOCS 2007, pp. 150\u2013160. IEEE Press, Los Alamitos (2007)"},{"key":"9_CR9","doi-asserted-by":"crossref","unstructured":"Achlioptas, D., Beame, P., Molloy, M.: A sharp threshold in proof complexity. In: Proceedings of STOC 2001, pp. 337\u2013346 (2001)","DOI":"10.1145\/380752.380820"},{"issue":"4","key":"9_CR10","doi-asserted-by":"publisher","first-page":"1048","DOI":"10.1137\/S0097539700369156","volume":"31","author":"P. Beame","year":"2002","unstructured":"Beame, P., Karp, R., Pitassi, T., Saks, M.: The efficiency of resolution and Davis-Putnam procedures. SIAM Journal on Computing\u00a031(4), 1048\u20131075 (2002)","journal-title":"SIAM Journal on Computing"},{"key":"9_CR11","first-page":"331","volume-title":"Proceedings of IJCAI 1991","author":"P. Cheeseman","year":"1991","unstructured":"Cheeseman, P., Kanefsky, B., Taylor, W.: Where the really hard problems are. In: Proceedings of IJCAI 1991, pp. 331\u2013337. Morgan Kaufmann, San Francisco (1991)"},{"key":"9_CR12","doi-asserted-by":"crossref","unstructured":"Cook, S., Mitchell, D.: Finding hard instances of the satisfiability problem: A survey. In: Du, Gu, Pardalos (eds.) Satisfiability Problem: Theory and Applications. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol.\u00a035, American Mathematical Society (1997)","DOI":"10.1090\/dimacs\/035\/01"},{"issue":"3","key":"9_CR13","doi-asserted-by":"publisher","first-page":"430","DOI":"10.1111\/0824-7935.00069","volume":"14","author":"I. Gent","year":"1998","unstructured":"Gent, I., Walsh, T.: Analysis of heuristics for number partitioning. Computational Intelligence\u00a014(3), 430\u2013451 (1998)","journal-title":"Computational Intelligence"},{"issue":"4","key":"9_CR14","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/s10601-005-2807-z","volume":"10","author":"C. Gomes","year":"2005","unstructured":"Gomes, C., Fernandez, C., Selman, B., Bessiere, C.: Statistical regimes across constrainedness regions. Constraints\u00a010(4), 313\u2013337 (2005)","journal-title":"Constraints"},{"key":"9_CR15","doi-asserted-by":"crossref","first-page":"517","DOI":"10.1613\/jair.2155","volume":"28","author":"Y. Gao","year":"2007","unstructured":"Gao, Y., Culberson, J.: Consistency and random constraint satisfaction models. Journal of Artificial Intelligence Research\u00a028, 517\u2013557 (2007)","journal-title":"Journal of Artificial Intelligence Research"},{"key":"9_CR16","unstructured":"Gao, Y.: Random instances of parameterized complete problems: phase transitions and complexity, Tech. rep., Computer Science, University of British Columbia Okanagan (2007)"},{"key":"9_CR17","unstructured":"Culberson, J., Gao, Y., Anton, C.: Phase transitions of dominating clique problem and their implications to heuristics in satisfiability search. In: Proceedings of IJCAI 2005, pp. 78\u201383 (2005)"},{"key":"9_CR18","doi-asserted-by":"publisher","first-page":"394","DOI":"10.1145\/368273.368557","volume":"5","author":"M. Davis","year":"1962","unstructured":"Davis, M., Logemann, G., Loveland, D.: A machine program for theorem proving. Communications of the ACM\u00a05, 394\u2013397 (1962)","journal-title":"Communications of the ACM"},{"issue":"1-3","key":"9_CR19","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1016\/j.tcs.2007.06.014","volume":"385","author":"D. Kratsch","year":"2007","unstructured":"Kratsch, D., Liedloff, M.: An exact algorithm for the minimum dominating clique problem. Theoretical Computer Science\u00a0385(1-3), 226\u2013240 (2007)","journal-title":"Theoretical Computer Science"},{"key":"9_CR20","doi-asserted-by":"crossref","DOI":"10.1002\/0471722154","volume-title":"The Probabilistic Method","author":"N. Alon","year":"2000","unstructured":"Alon, N., Spencer, J.H.: The Probabilistic Method. Wiley, Chichester (2000)"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Satisfiability Testing \u2013 SAT 2008"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-79719-7_9.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T11:29:16Z","timestamp":1619522956000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-79719-7_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540797180","9783540797197"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-79719-7_9","relation":{},"subject":[]}}