Abstract
The study of random instances of NP complete and coNP complete problems has had much impact on our understanding of the nature of hard problems as well as the strength and weakness of well-founded heuristics. This work is part of our effort to extend this line of research to intractable parameterized problems. We consider instances of the threshold dominating clique problem and the weighted satisfiability under some natural instance distribution. We study the threshold behavior of the solution probability and analyze some simple (polynomial-time) algorithms for satisfiable random instances. The behavior of these simple algorithms may help shed light on the observation that small-sized backdoor sets can be effectively exploited by some randomized DPLL-style solvers. We establish lower bounds for a parameterized version of the ordered DPLL resolution proof procedure for unsatisfiable random instances.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
References
Downey, R., Fellows, M.: Parameterized Complexity. Springer, Heidelberg (1999)
Neidermeier, R.: Invitation to Fixed-Parameter Algorithms. Oxford University Press, Oxford (2006)
Gottlob, G., Szeider, S.: Fixed-parameter algorithms for artificial intelligence, constraint satisfaction, and database problems. The Computer Journal (to appear)
Dilkina, B., Gomes, C., Sabharwal, A.: Tradeoffs in the complexity of backdoor detection. In: Bessière, C. (ed.) CP 2007. LNCS, vol. 4741, pp. 256–270. Springer, Heidelberg (2007)
Szeider, S.: Backdoor sets for DLL subsolvers. Journal of Automated Reasoning (1-3) 73–88 (2005)
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. 3542, Springer, Heidelberg (2005)
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. 2919, pp. 222–230. Springer, Heidelberg (2004)
Dantchev, S., Martin, B., Szeider, S.: Parameterized proof complexity. In: Proceedings of FOCS 2007, pp. 150–160. IEEE Press, Los Alamitos (2007)
Achlioptas, D., Beame, P., Molloy, M.: A sharp threshold in proof complexity. In: Proceedings of STOC 2001, pp. 337–346 (2001)
Beame, P., Karp, R., Pitassi, T., Saks, M.: The efficiency of resolution and Davis-Putnam procedures. SIAM Journal on Computing 31(4), 1048–1075 (2002)
Cheeseman, P., Kanefsky, B., Taylor, W.: Where the really hard problems are. In: Proceedings of IJCAI 1991, pp. 331–337. Morgan Kaufmann, San Francisco (1991)
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. 35, American Mathematical Society (1997)
Gent, I., Walsh, T.: Analysis of heuristics for number partitioning. Computational Intelligence 14(3), 430–451 (1998)
Gomes, C., Fernandez, C., Selman, B., Bessiere, C.: Statistical regimes across constrainedness regions. Constraints 10(4), 313–337 (2005)
Gao, Y., Culberson, J.: Consistency and random constraint satisfaction models. Journal of Artificial Intelligence Research 28, 517–557 (2007)
Gao, Y.: Random instances of parameterized complete problems: phase transitions and complexity, Tech. rep., Computer Science, University of British Columbia Okanagan (2007)
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–83 (2005)
Davis, M., Logemann, G., Loveland, D.: A machine program for theorem proving. Communications of the ACM 5, 394–397 (1962)
Kratsch, D., Liedloff, M.: An exact algorithm for the minimum dominating clique problem. Theoretical Computer Science 385(1-3), 226–240 (2007)
Alon, N., Spencer, J.H.: The Probabilistic Method. Wiley, Chichester (2000)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gao, Y. (2008). Random Instances of W[2]-Complete Problems: Thresholds, Complexity, and Algorithms. In: Kleine Büning, H., Zhao, X. (eds) Theory and Applications of Satisfiability Testing – SAT 2008. SAT 2008. Lecture Notes in Computer Science, vol 4996. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-79719-7_9
Download citation
DOI: https://doi.org/10.1007/978-3-540-79719-7_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-79718-0
Online ISBN: 978-3-540-79719-7
eBook Packages: Computer ScienceComputer Science (R0)