Backdoors to Satisfaction

Details Backdoors to Satisfaction Backdoors to Satisfaction

2011-10-28

arxiv.org/abs/1110.6387v2

Computer Science

Data Structures and Algorithms

Scientific paper

A backdoor set is a set of variables of a propositional formula such that fixing the truth values of the variables in the backdoor set moves the formula into some polynomial-time decidable class. If we know a small backdoor set we can reduce the question of whether the given formula is satisfiable to the same question for one or several easy formulas that belong to the tractable class under consideration. In this survey we review parameterized complexity results for problems that arise in the context of backdoor sets, such as the problem of finding a backdoor set of size at most k, parameterized by k. We also discuss recent results on backdoor sets for problems that are beyond NP.

Affiliated with

Also associated with

No associations

Rating

Backdoors to Satisfaction does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Backdoors to Satisfaction, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Backdoors to Satisfaction will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-686633