Given a 2-SAT formula F consisting of n variables and b n random clauses, what is the largest number of clauses maxF satisfiable by a single assignment of the variables? We bound the answer away from the trivial bounds of 34 n and n. We prove that for < 1, the expected number of clauses satisfiable is b n o(1); for large , it is ( 34 + (p ))n; for = 1 + ", it is at least (1 + " O("3))n and at m...
