Parameterizing above guaranteed values: MaxSat and MaxCut
Journal of Algorithms
Journal of Computer and System Sciences - Special issue on the fourteenth annual IEE conference on computational complexity
On the power of unique 2-prover 1-round games
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Which problems have strongly exponential complexity?
Journal of Computer and System Sciences
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Beating the Random Ordering is Hard: Inapproximability of Maximum Acyclic Subgraph
FOCS '08 Proceedings of the 2008 49th Annual IEEE Symposium on Foundations of Computer Science
Every Permutation CSP of arity 3 is Approximation Resistant
CCC '09 Proceedings of the 2009 24th Annual IEEE Conference on Computational Complexity
A probabilistic approach to problems parameterized above or below tight bounds
Journal of Computer and System Sciences
A new bound for 3-satisfiable maxsat and its algorithmic application
FCT'11 Proceedings of the 18th international conference on Fundamentals of computation theory
Paths, flowers and vertex cover
ESA'11 Proceedings of the 19th European conference on Algorithms
Journal of Computer and System Sciences
Beating the Random Ordering Is Hard: Every Ordering CSP Is Approximation Resistant
SIAM Journal on Computing
Solving MAX-r-SAT Above a Tight Lower Bound
Algorithmica
Systems of linear equations over F2 and problems parameterized above average
SWAT'10 Proceedings of the 12th Scandinavian conference on Algorithm Theory
Parameterizing MAX SNP problems above guaranteed values
IWPEC'06 Proceedings of the Second international conference on Parameterized and Exact Computation
On multiway cut parameterized above lower bounds
IPEC'11 Proceedings of the 6th international conference on Parameterized and Exact Computation
Parameterized Complexity
New lower bound on max cut of hypergraphs with an application to r-set splitting
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
Constraint satisfaction problems parameterized above or below tight bounds: a survey
The Multivariate Algorithmic Revolution and Beyond
On the parameterized complexity of the workflow satisfiability problem
Proceedings of the 2012 ACM conference on Computer and communications security
On the Parameterized Complexity and Kernelization of the Workflow Satisfiability Problem
ACM Transactions on Information and System Security (TISSEC)
Parameterized complexity of MaxSat Above Average
Theoretical Computer Science
Hi-index | 0.00 |
In MaxSat, we are given a CNF formula F with n variables and m clauses and asked to find a truth assignment satisfying the maximum number of clauses. Let r1,…, rm be the number of literals in the clauses of F. Then asat(F) = ∑mi=1 (1 - 2-ri) is the expected number of clauses satisfied by a random truth assignment (the truth values to the variables are distributed uniformly and independently). It is well-known that, in polynomial time, one can find a truth assignment satisfying at least asat(F) clauses. In the parameterized problem MaxSat-AA, we are to decide whether there is a truth assignment satisfying at least asat(F)+k clauses, where k is the (nonnegative) parameter. We prove that MaxSat-AA is para-NP-complete and thus, MaxSat-AA is not fixed-parameter tractable unless P=NP. This is in sharp contrast to the similar problem MaxLin2-AA which was recently proved to be fixed-parameter tractable by Crowston et al. (FSTTCS 2011). In fact, we consider a more refined version of MaxSat-AA, Max-r(n)-Sat-AA, where rj≤r(n) for each j. Alon et al. (SODA 2010) proved that if r=r(n) is a constant, then Max-r-Sat-AA is fixed-parameter tractable. We prove that Max-r(n)-Sat-AA is para-NP-complete for r(n)=⌈logn⌉. We also prove that assuming the exponential time hypothesis, Max-r(n)-Sat-AA is not fixed-parameter tractable already for any r(n)≥loglogn+φ(n), where φ(n) is any unbounded strictly increasing function. This lower bound on r(n) cannot be decreased much further as we prove that Max-r(n)-Sat-AA is fixed-parameter tractable for any r(n)≤loglogn−logloglogn−φ(n), where φ(n) is any unbounded strictly increasing function. The proof uses some results on MaxLin2-AA.