Data reductions, fixed parameter tractability, and random weighted d-CNF satisfiability
نویسنده
چکیده
Article history: Received 19 December 2008 Received in revised form 11 June 2009 Accepted 13 June 2009 Available online 17 June 2009
منابع مشابه
A Fixed-Parameter Algorithm for Random Instances of Weighted d-CNF Satisfiability
We study random instances of the weighted d-CNF satisfiability problem (WEIGHTED dSAT), a generic W[1]-complete problem. A random instance of the problem consists of a fixed parameter k and a random d-CNF formula F k,d generated as follows: for each subset of d variables and with probability p, a clause over the d variables is selected uniformly at random from among the 2 − 1 clauses that conta...
متن کاملAlmost 2-SAT is Fixed-Parameter Tractable
We consider the following problem. Given a 2-CNF formula, is it possible to remove at most k clauses so that the resulting 2-CNF formula is satisfiable? This problem is known to different research communities in Theoretical Computer Science under the names ’Almost 2SAT’, ’All-but-k 2-SAT’, ’2-CNF deletion’, ’2-SAT deletion’. The status of fixed-parameter tractability of this problem is a long-s...
متن کاملAlmost 2-SAT Is Fixed-Parameter Tractable (Extended Abstract)
We consider the following problem. Given a 2-cnf formula, is it possible to remove at most k clauses so that the resulting 2-cnf formula is satisfiable? This problem is known to different research communities in theoretical computer science under the names Almost 2-SAT, All-but-k 2-SAT, 2-cnf deletion, and 2-SAT deletion. The status of the fixed-parameter tractability of this problem is a long-...
متن کاملWhen is weighted satisfiability in FPT?∗
We consider the weighted monotone and antimonotone satisfiability problems on normalized circuits of depth at most t ≥ 2, abbreviated wsat[t] and wsat−[t], respectively. These problems model the weighted satisfiability of monotone and antimonotone propositional formulas (including weighted monotone/antimonotone cnf-sat) in a natural way, and serve as the canonical problems in the definition of ...
متن کاملPhase Transitions and Complexity of Weighted Satisfiability and Other Intractable Parameterized Problems
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. In this work, we initiate an effort to extend this line of research to random instances of intractable parameterized problems. We propose random models for a representative intractable parameterized problem, the weighted d-CNF satisfiability, and its g...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Artif. Intell.
دوره 173 شماره
صفحات -
تاریخ انتشار 2009