Random instances of W[2]-complete problems: thresholds, complexity, and algorithms

Authors:
Yong Gao
Affiliations:
Department of Computer Science, Irving K. Barber School of Arts and Sciences, University of British Columbia Okanagan, Kelowna, Canada
Venue:
SAT'08 Proceedings of the 11th international conference on Theory and applications of satisfiability testing
Year:
2008

Citing 12
Cited 2

A machine program for theorem-proving

Communications of the ACM
A sharp threshold in proof complexity

STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
The Efficiency of Resolution and Davis--Putnam Procedures

SIAM Journal on Computing
Statistical Regimes Across Constrainedness Regions

Constraints
Backdoor Sets for DLL Subsolvers

Journal of Automated Reasoning
An exact algorithm for the minimum dominating clique problem

Theoretical Computer Science
Parameterized Proof Complexity

FOCS '07 Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science
Consistency and random constraint satisfaction models

Journal of Artificial Intelligence Research
Where the really hard problems are

IJCAI'91 Proceedings of the 12th international joint conference on Artificial intelligence - Volume 1
Phase transitions of dominating clique problem and their implications to heuristics in satisfiability search

IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Tradeoffs in the complexity of backdoor detection

CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
Fixed-Parameter Algorithms For Artificial Intelligence, Constraint Satisfaction and Database Problems

The Computer Journal

Phase transitions and complexity of weighted satisfiability and other intractable parameterized problems

AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
Threshold dominating cliques in random graphs and interval routing

Journal of Discrete Algorithms

Quantified Score

Hi-index	0.00

Visualization

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.